Safe Motion Planning Based on a New Encoding Technique for Tree Expansion Using Particle Swarm Optimization

Author:

Bouraine SaraORCID,Azouaoui Ouahiba

Abstract

SUMMARYRobots are now among us and even though they compete with human beings in terms of performance and efficiency, they still fail to meet the challenge of performing a task optimally while providing strict motion safety guarantees. It is therefore necessary that the future generation of robots evolves in this direction. Generally, in robotics state-of-the-art approaches, the trajectory optimization and the motion safety issues have been addressed separately. An important contribution of this paper is to propose a motion planning method intended to simultaneously solve these two problems in a formal way. This motion planner is dubbed PassPMP-PSO. It is based on a periodic process that interleaves planning and execution for a regular update of the environment’s information. At each cycle, PassPMP-PSO computes a safe near-optimal partial trajectory using a new tree encoding technique based on particle swarm optimization (PSO). The performances of the proposed approach are firstly highlighted in simulation environments in the presence of moving objects that travel at high speed with arbitrary trajectories, while dealing with sensors field-of-view limits and occlusions. The PassPMP-PSO algorithm is tested for different tree expansions going from 13 to more than 200 nodes. The results show that for a population between 20 and 100 particles, the frequency of obtaining optimal trajectory is 100% with a rapid convergence of the algorithm to this solution. Furthermore, an experiment-based comparison demonstrates the performances of PassPMP-PSO over two other motion planning methods (the PassPMP, a previous variant of PassPMP-PSO, and the input space sampling). Finally, PassPMP-PSO algorithm is assessed through experimental tests performed on a real robotic platform using robot operating system in order to confirm simulation results and to prove its efficiency in real experiments.

Publisher

Cambridge University Press (CUP)

Subject

Computer Science Applications,General Mathematics,Software,Control and Systems Engineering

Reference96 articles.

1. LQG-MP: Optimized Path Planning for Robots with Motion Uncertainty and Imperfect State Information;van den Berg;Robot. Sci. Syst.,2011

2. 74. Qin, Q. , “Path Planning for Mobile Robot Using the Particle Swarm Optimization with Mutation Operator,” Proceedings of International Conference on Machine Learning and Cybernetics, vol. 4 (2004) pp. 2473–2478.

3. 35. Fergusson, D. , Kalra, N. and Kuffner, A. , “Anytime Path Planning and Replanning in Dynamic Environment,” IEEE International Conference on Robotics and Automation (2006) pp. 2366–2371.

4. 85. Bautin, A. , Martinez-Gomez, L. and Fraichard, T. “Inevitable Collision States: A Probabilistic Perspective,” IEEE International Conference on Robotics and Automation (2010) pp. 4022–4027.

5. 88. Rohrmuller, F. , Althoff, M. , D. Wollherr and M. Buss “Probabilistic Mapping of Dynamic Obstacles Using Markov Chains for Replanning in Dynamic Environments,” Proceedings of the IEEE/RSJ International Conference on Intelligent Robots and Systems (2008) pp. 2504–2510.

Cited by 12 articles. 订阅此论文施引文献 订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3