Skip to main content Accessibility help
×
Home

Optimal Path Planning Satisfying Complex Task Requirement in Uncertain Environment

  • Xin-Yi Yu (a1), Zhen-Yong Fan (a1), Lin-Lin Ou (a1), Feng Zhu (a1) and Yong-Kui Guo (a1)...

Summary

Robots often need to accomplish some complex tasks such as surveillance, response and obstacle avoidance. In this paper, a dynamic search method is proposed to generate optimal robot trajectories satisfying complex task requirement in uncertain environment. The LTL-A* algorithm is presented to generate a global optimal path and the A* algorithm is provided to modify the global optimal path. The task is specified by a linear temporal logic (LTL) formula, and a weighted transition system according to the known information in uncertain environment is modeled to describe the robot motion. Subsequently, a product automaton is constructed by combining the transition system with the task requirement. Based on the product automaton, the LTL-A* algorithm is proposed to generate a global optimal path. The local path planning based on the A* algorithm is employed to deal with the environment change during the process of tracking the global optimal path for the robot. The results of the simulation and experiments show that the proposed method can not only meet the complex task requirement in uncertain environment but also improve the search efficiency.

Copyright

Corresponding author

*Corresponding author. E-mail: linlinou@zjut.edu.cn

References

Hide All
1.Xu, B. G., Yi, Y. X. and Zhou, M. J., “Current status and prospects of intelligent mobile robot technology,” Rob. Tech. Appl. 2(2), 2934 (2007).
2.Chabini, I. and Lan, S., “Adaptations of the A* algorithm for the computation of fastest paths in deterministic discrete-time dynamic networks,” Trans. Intell. Transp. Syst. 3(1), 6074 (2002).10.1109/6979.994796
3.Xu, Y. and Liu, R., “Path planning for mobile articulated robots based on the improved A* algorithm,” Int. J. Adv. Rob. Syst. 14(4), 110 (2017).
4.Tu, J. and Yang, S. X., “Genetic algorithm based path planning for a mobile robot,International Conference on Robotics and Automation, Taipei, Taiwan (2003), pp. 12211226.
5.Shi, Y., “Particle swarm optimization: Developments, applications and resources,” Int. Conf. Evol. Comput. 1, 8186 (2001).
6.Kennedy, J., Particle Swarm Optimization. Encyclopedia of Machine Learning (Springer, Perth, Australia, 2011), pp. 760766.
7.Fan, X., Luo, X., Yi, S., Yang, S. and Zhang, H., “Optimal path planning for mobile robots based on intensified ant colony optimization algorithm,International Conference on Robotics, Intelligent Systems and Signal, Changsha, China (2003) pp. 131136.
8.Xu, W. L., Tso, S. K. and Fung, Y. H., “Sensor-based reactive navigation of a mobile robot through local target switching,International Conference on Advanced Robotics, Monterey, CA, USA (1997), pp. 361366.
9.Stentz, A., “The focussed D* algorithm for real-time replanning,International Joint Conference on Artificial Intelligence, Montreal, Quebec, Canada (1995) pp. 16521659.
10.Qureshi, A. H. and Ayaz, Y., “Intelligent bidirectional rapidly-exploring random trees for optimal motion planning in complex cluttered environments,” Rob. Autonom. Syst. 68, 111 (2015).10.1016/j.robot.2015.02.007
11.Zhang, B. T., Liu, Y., Lu, Q. and Wang, J., “A path planning strategy for searching the most reliable path in uncertain environments,” Int. J. Adv. Rob. Syst. 13(5), 19 (2016).
12.Wei, C. Y. and Ni, F. S., “Tabu temporal difference learning for robot path planning in uncertain environments,Lect. Notes Comput. Sci. 123–134 (Springer, Cham, 2018).
13.Deepak, N. S., Wei, Q. T. and Pierre, F. J., “Stochastic time-optimal path-planning in uncertain, strong, and dynamic flows,” Comput. Methods Appl. Mech. Eng. 333, 218237 (2018).
14.Shlomi, H., Shraga, S. and Nir, S., “Applying probability navigation function in dynamic uncertain environments,” Rob. Autonom. Syst. 87, 237246 (2017).
15.Bacchus, F. and Kabanza, F., “Planning for temporally extended goals,” Ann. Math. Artif. Intell. 22, 527 (1998).10.1023/A:1018985923441
16.Xinyi, Y., Hao, C., Yongkui, G., Cheng, C., Linlin, O. and Li, Y., “Path planing of warehouse robots based on linear temporal logic,” Chin Hig. Technol. Lett. 26(1), 1623 (2016).
17.Xiao, Y. T., Lin-Lin, O. and Li, Y., “Optimal patrolling path planning via linear temporal logic,” Acta Autom. Sin. 40(10), 21262133 (2014).
18.Guo, M., Johansson, K. H. and Dimarogonas, D. V., “Motion and action planning under LTL specifications using navigation functions and action description language,International Conference on Intelligent Robots and Systems, Tokyo, Japan (2013) pp. 240245.
19.Leahy, K. J., Aksaray, D. and Belta, C., “Informative path planning under temporal logic constraints with performance guarantees,American Control Conference, Seattle, WA, USA (2017) pp. 18591865.
20.Kloetzer, M. and Mahulea, C., “LTL planning in dynamic environments,” Int. Fed. Accountants 45, 294300 (2012).
21.Ayala, A. M., Andersson, S. B. and Belta, C., “Temporal logic motion planning in unknown environments,International Conference on Intelligent Robots and Systems, Tokyo, Japan (2013) pp. 52795284.
22.Xu, N., Li, J., Niu, Y. and Shen, L., “An LTL-based motion and action dynamic planning method for autonomous robot,” Int. Fed. Accountants. Ifac PapersOnLine. 49, 9196 (2016).10.1016/j.ifacol.2016.07.095
23.Wang, H., Yu, Y. and Yuan, Q., “Application of Dijkstra algorithm in robot path-planning,Second International Conference on Mechanic Automation and Control Engineering, Inner Mongolia, China (2011) pp. 10671069.10.1109/MACE.2011.5987118
24.Sheng-qun, C. and Lin-fei, D., “Applied analysis of Dijkstra algorithm and A-star algorithm in the intelligent guiding,” J. Chongqing Univ. Sci. Technol. (Natural Sciences Edition) (2010), pp. 16731980.
25.Nannicini, G., Delling, D., Liberti, L. and Schultes, D., “Bidirectional A Search for time-dependent fast paths,” J. Am. Chem. Soc. 136(24), 86268641 (2014).
26.Soltani, R., Tawfik, H., Goulermas, J. Y. and Fernando, T., “Path planning in construction sites: Performance evaluation of the Dijkstra, A *, and GA search algorithms,” Adv. Eng. Inf. 16, 291303 (2002).10.1016/S1474-0346(03)00018-1
27.Yao, J., Lin, C., Xie, X. and Wang, A. J., “Path planning for virtual human motion using improved A* star algorithm,Seventh International Conference on Information Technology, Las Vegas, NV, USA (2010), pp. 5358.
28.Smith, S. L., Tůmová, J., Belta, C. and Rus, D., “Optimal path planning under temporal logic constraints,” International Conference on Intelligent Robots and Systems, Taipei, Taiwan (2010) pp. 32883293.
29.Emerson, E. A., “Temporal and modal logic,Handb. Theor. Comput. Sci. 9951072 (Elsevier, Amsterdam, Netherlands, 1990).
30.Gastin, P. and Oddoux, D., “Fast LTL to Büchi automata translation,International Conference on Computer Aided Verification, Paris, France (2001) pp. 5365.10.1007/3-540-44585-4_6
31.Smith, S. L., Tůmová, J., Belta, C. and Rus, D., “Optimal path planning for surveillance with temporal-logic constraints,” Int. J. Rob. Res. 30(14), 16951708 (2011).10.1177/0278364911417911
32.Hart, P. E., Nilsson, N. J. and Raphael, B., “A formal basis for the heuristic determination of minimum cost paths,” IEEE Trans. Syst. Sci. Cybern. 4, 100107 (1968).10.1109/TSSC.1968.300136

Keywords

Metrics

Full text views

Total number of HTML views: 0
Total number of PDF views: 0 *
Loading metrics...

Abstract views

Total abstract views: 0 *
Loading metrics...

* Views captured on Cambridge Core between <date>. This data will be updated every 24 hours.

Usage data cannot currently be displayed