Abstract
In this paper, we implement a Linear Temporal Logic-based motion planning algorithm for a prioritized mission scenario. The classic robot motion planning solves the problem of moving a robot from a source to a goal configuration while avoiding obstacles. This problem of motion planning gets complicated when the robot is asked to solve a complex goal specification incorporating boolean and temporal constraints between the atomic goals. This problem is referred to as the mission planning. The paper assumes that the mission to be solved is a collection of smaller tasks, wherein each task constituting the mission must be finished within a given amount of time. We assign the priorities for the tasks such that, the higher priority tasks should be completed beforehand. The planner solves the missions in multiple groups, instead of the classic approach of solving all the tasks at once. The group is dynamic and is a function of how many tasks can be incorporated such that no time deadline is lost. The grouping based prioritized and time-based planning saves a significant amount of time as compared to the inclusion of time information in the verification engine that complicates the search logic. NuSMV tool is used to verify the logic. Comparisons are made by solving all tasks at once and solving the tasks one-by-one. Experimental results reveal that the proposed solver is able to meet the deadlines of nearly all tasks while taking a small computation time.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Choset, H., et al.: Principles of Robot Motion: Theory, Algorithms, and Implementations. MIT Press, Cambridge (2005)
Holzmann, G.: The model checker SPIN. IEEE Trans. Softw. Eng. 25(5), 279–295 (1997)
Cimatti, A., et al.: NuSMV 2: an OpenSource tool for symbolic model checking. In: Brinksma, E., Larsen, K.G. (eds.) CAV 2002. LNCS, vol. 2404, pp. 359–364. Springer, Heidelberg (2002). https://doi.org/10.1007/3-540-45657-0_29
Vardi, M.Y., Wolper, P.: An automata-theoretic approach to automatic program verification. In: Logic in Computer Science, pp. 322–331 (1986)
Finucane, C., Jing, G., Kress-Gazit, H.: LTLMoP: experimenting with language, temporal Logic and robot control. In: 2010 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS), 18–22 October 2010, pp. 1988–1993 (2010)
Fainekos, G.E., Kress-Gazit, H., Pappas, G.J.: Temporal logic motion planning for mobile robots. In: Proceedings of the 2005 IEEE International Conference on Robotics and Automation, Barcelona, Spain, pp. 2020–2025 (2005). https://doi.org/10.1109/robot.2005.1570410
Antoniotti, M., Mishra, B.: Discrete event models+temporal logic=supervisory controller: automatic synthesis of locomotion controllers. In: Proceedings of 1995 IEEE International Conference on Robotics and Automation, Nagoya, Japan, vol. 2, pp. 1441–1446 (1995). https://doi.org/10.1109/robot.1995.525480
Kress-Gazit, H., Fainekos, G.E., Pappas, G.J.: Temporal-logic-based reactive mission and motion planning. IEEE Trans. Robot. 25(6), 1370–1381 (2009). https://doi.org/10.1109/TRO.2009.2030225
Shewchuk, J.R.: Triangle: engineering a 2D quality mesh generator and Delaunay triangulator. In: Lin, M.C., Manocha, D. (eds.) WACG 1996. LNCS, vol. 1148, pp. 203–222. Springer, Heidelberg (1996). https://doi.org/10.1007/BFb0014497
Karaman, S., Frazzoli, E.: Vehicle routing problem with metric temporal logic specifications. In: IEEE DCC, December 2008
Bhatia, A., Kavraki, L.E., Vardi, M.Y.: Sampling-based motion planning with temporal goals. In: 2010 IEEE International Conference on Robotics and Automation (ICRA), 3–7 May 2010, pp. 2689–2696 (2010). https://doi.org/10.1109/robot.2010.5509503
Kala, R.: Sampling based mission planning for multiple robots. In: Proceedings of the 2016 IEEE Congress on Evolutionary Computation, Vancouver, BC, Canada, pp. 662–669 (2016)
Kala, R.: Dynamic programming accelerated evolutionary planning for constrained robotic missions. In: Proceedings of the IEEE Conference on Simulation, Modelling and Programming for Autonomous Robots, Brisbane, Australia, pp. 81–86 (2018)
Ruppert, J.: A delaunay refinement algorithm for quality 2-dimensional mesh generation. J. Algorithms 18(3), 548–585 (1995)
Acknowledgement
The research is supported by the Indian Institute of Information Technology, Allahabad and the Science and Engineering Research Board, Department of Science and Technology, Government of India through project number ECR/2015/000406.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2019 ICST Institute for Computer Sciences, Social Informatics and Telecommunications Engineering
About this paper
Cite this paper
Beri, V., Kala, R., Nandi, G.C. (2019). Time Bound Robot Mission Planning for Priority Machine Using Linear Temporal Logic for Multi Goals. In: Kumar, N., Venkatesha Prasad, R. (eds) Ubiquitous Communications and Network Computing. UBICNET 2019. Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering, vol 276. Springer, Cham. https://doi.org/10.1007/978-3-030-20615-4_19
Download citation
DOI: https://doi.org/10.1007/978-3-030-20615-4_19
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-20614-7
Online ISBN: 978-3-030-20615-4
eBook Packages: Computer ScienceComputer Science (R0)