Abstract
This paper focuses on path planning for a remote robotic agent using rough mereology potential field method. We test the proposed path-creation and path-finding algorithms and propose working alternative versions. Furthermore we apply path smoothing with custom collision detection to further optimize the route from the robot initial position to the goal.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsReferences
Polkowski, L.: Rough mereology: a new paradigm for approximate reasoning. Int. J. Approx. Reason. 15(4), 333–365 (1996)
Osmialowski, P.: Planning and Navigation for Mobile Autonomous Robots Spatial Reasoning in Player/Stage System (2011)
O’smiaıowski, P., Polkowski, L.: Spatial reasoning based on rough mereology: a notion of a robot formation and path planning problem for formations of mobile autonomous robots. In: Peters, J.F., Skowron, A., Słowiński, R., Lingras, P., Miao, D., Tsumoto, S. (eds.) Transactions on Rough Sets XII. LNCS, vol. 6190, pp. 143–169. Springer, Heidelberg (2010). doi:10.1007/978-3-642-14467-7_8
Szmigielski, A., Polkowski, L.: Computing from words via rough mereology in mobile robot navigation. In: Proceedings of the 2003 IEEE/RSJ International Conference on Intelligent Robots and Systems, (IROS 2003) (2003)
Artiemjew, P.: Rough mereology classifier vs simple DNA microarray gene extraction methods. Int. J. Data Min. Model. Manag. Spec. Issue: Pattern Recogn. 6(2), 110–126 (2014)
Klinov, P., Mazlack, J.L.: On possible applications of rough mereology to handling granularity in ontological knowledge. In: Proceedings of the Twenty-Second AAAI Conference on Artificial Intelligence, 22–26 July 2007, Vancouver, British Columbia, Canada (2007)
Mereology Camera Navigation. https://github.com/lukzmu/mereology-camera-navigation
OpenCV. http://opencv.org
Python AR Markers. https://github.com/DebVortex/python-ar-markers
NXT Python. https://github.com/Eelviny/nxt-python
The result of tests in the video. https://youtu.be/UrGvUoj_yeI
Acknowledgements
This research has been supported by a grant 23.610.007-300 from the Ministry of Science and Higher Education of the Republic of Poland, and grant 23.620.0010-300 for young scientists from Department of Mathematics and Computer Sciences of University of Warmia and Mazury in Olsztyn.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2017 Springer International Publishing AG
About this paper
Cite this paper
Zmudzinski, L., Artiemjew, P. (2017). Path Planning Based on Potential Fields from Rough Mereology. In: Polkowski, L., et al. Rough Sets. IJCRS 2017. Lecture Notes in Computer Science(), vol 10314. Springer, Cham. https://doi.org/10.1007/978-3-319-60840-2_11
Download citation
DOI: https://doi.org/10.1007/978-3-319-60840-2_11
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-60839-6
Online ISBN: 978-3-319-60840-2
eBook Packages: Computer ScienceComputer Science (R0)