Skip to main content Accessibility help

Artificial moment method using attractive points for the local path planning of a single robot in complicated dynamic environments

  • Wang-bao Xu (a1) (a2), Jie Zhao (a3), Xue-bo Chen (a2) and Ying Zhang (a2)


A novel path planner is presented for the local path planning of a single robot (represented with R) in a complicated dynamic environment. Here a series of attractive points are computed based on attractive segments for guiding R to move along a shorter path. Each attractive segment is obtained by using the full environmental knowledge and will be used for several sampling times in general. A motion controller, which is designed based on artificial moments and a robot model that has a principal motion direction line(PMDline), makes R move closely to attractive points while away from obstacles. Attractive and repulsive moments are designed, which only make R's PMDline face toward attractive points and opposite to obstacles in general, as in most cases, R will move along its PMDline with its full speed. Because of the guidance of attractive points and R's full-speed motion, the global convergence is guaranteed. Simulations indicate that the proposed path planner meets the requirements of real-time property while can optimize R's traveling path.


Corresponding author

*Corresponding author. E-mail:


Hide All
1.Hsu, D., Latombe, J. C. and Motwani, R., “Path planning in expansive configuration spaces,” Int. J. Comput. Geom. Appl. 9 (4&5), 495512 (1999).
2.Nearchou, A. C., “Path planning of a mobile robot using genetic heuristics,” Robotica 16, 575588 (1998).
3.Undeger, C. and Polat, F., “Real-time edge follow: A real-time path search approach,” IEEE Trans. Syst. Man Cybern. Part C: Appl. Rev. 37 (5), 860872 (2007).
4.Ge, S. S., Lai, X. and Mamum, A. A., “Boundary following and globally convergent path using instant goals,” IEEE Trans. Syst. Man Cybern. Part B: Cybern. 35 (2), 240254 (2005).
5.Salichs, M. A. and Moreno, L., “Navigation of mobile robots: Open questions,” Robotica 18, 227234 (2000).
6.Huang, H. P. and Chung, S. Y., “Dynamic Visibility Graph for Path Planning,” In: Proceedings of IEEE/RSJ International Conference on Intelligent Robots and Systems, Sendai, Japan (2004) pp. 28132818.
7.Takahashi, O. and Schilling, R. J., “Motion planning in a plane using generalized Voronoi diagrams”, IEEE Trans. Robot. Autom. 5 (2), 143150 (1989).
8.Sud, A., Andersen, E., Curtis, S., Lin, M. C. and Manocha, D., “Real-time path planning in dynamic virtual environments using multiagent navigation graphs,” IEEE Trans. Vis. Comput. Graph. 14 (3), 526538 (2008).
9.Liu, Y. H. and Arimoto, S., “Proposal of Tangent Graph and Extended Tangent Graph for Path Planning of Mobile Robots,” In: Proceedings of IEEE International Conference on Robotics and Automation, Sacramento, CA (1991) pp. 312317.
10.Kamon, I., Rimon, E. and Rivlin, E., “Tangentbug: A range-sensor-based navigation algorithm,” Int. J. Robot. Res. 17 (9), 934953 (1998).
11.Kavraki, L. E., Svestka, P., Latombe, J. C. and Overmars, M. H., “Probabilistic roadmaps for path planning in high-dimensional configuration spaces,” IEEE Trans. Robot. Autom. 12 (4), 566580 (1996).
12.Cheng, P. and Lavalle, S. M., “Resolution Complete Rapidly-Exploring Random Trees,” In: Proceedings of IEEE International Conference on Robotics and Automation, Washington, America (2002) pp. 267272.
13.Yakey, J., Lavalle, S. M. and Kavraki, L. E., “Randomized path planning for linkages with closed kinematic chains,” IEEE Trans. Robot. Autom. 17 (6), 951958 (2001).
14.Rimon, E. and Koditschek, D. E., “Exact robot navigation using artificial potential functions,” IEEE Trans. Robot. Autom. 8 (5), 501518 (1992).
15.Oustaloup, A., Orsoni, B., Melchior, P. and Linarès, H., “Path planning by fractional differentiation,” Robotica 21 (1), 5969 (2003).
16.Ge, S. S. and Cui, Y. J.. “New potential functions for mobile robot path planning,” IEEE Trans. Robot. Autom. 16 (5), 615620 (2000).
17.Yin, L., Yin, Y. X. and Lin, C. J., “A new potential field method for mobile robot path planning in the dynamic environments”, Asian J. Control 11 (2), 214225 (2009).
18.Kim, D. H., “Escaping route method for a trap situation in local path planning,” Int. J. Control Autom. Syst. 7 (3), 495500 (2009).
19.Zhu, Y., Zhang, T. and Song, J. Y., “An Improved Wall Following Method for Escaping From Local Minimum in Artificial Potential Field Based Path Planning,” In: Proceedings of Joint 48th IEEE Conference on Decision and Control and 28th Chinese Control Conference, Shanghai, China (2009) pp. 60176022.
20.Ng, J. and Bräunl, T., “Performance comparison of bug navigation algorithms,” J. Intell. Robot. Syst. 50, 7384 (2007).
21.Besada-Portas, E., Torre, L., Cruz, J. M. and Andrés-Toro, B., “Evolutionary trajectory planner for multiple UAVs in realistic scenarios,” IEEE Trans. Robot. 26 (4), 619634 (2010).
22.Zhang, C. G. and Xi, Y. G., “Robot path planning in globally unknown environments based on rolling windows,” Sci. China-Ser. E 44 (2), 131139 (2001).
23.Zhang, C. G. and Xi, Y. G., “Rolling path planning and safety analysis of mobile robot in dynamic uncertain environment,” Control Theory Appl. (in Chinese) 20 (1), 3744 (2003).
24.Zhang, C. G. and Xi, Y. G., “A real-time path planning method for mobile robot avoiding oscillation and dead circulation,” Acta Autom. Sin. 29 (2), 197205 (2003).
25.Zhang, C. G. and Xi, Y. G., “Sub-optimality analysis of mobile robot rolling path planning,” Sci. China-Series F Inf. Sci. 46 (2), 116125 (2003).
26.Xu, W. B. and Chen, X. B., “Artificial moment method for swarm-robot formation control,” Sci. China-Ser. F: Inf. Sci. 51 (10), 15211531 (2008).
27.Xu, W. B. and Chen, X. B., “A dynamical formation control approach based on artificial moments,” Control Theory Appl. (in Chinese) 26 (11), 12321238 (2009).


Artificial moment method using attractive points for the local path planning of a single robot in complicated dynamic environments

  • Wang-bao Xu (a1) (a2), Jie Zhao (a3), Xue-bo Chen (a2) and Ying Zhang (a2)


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