Hostname: page-component-cd9895bd7-hc48f Total loading time: 0 Render date: 2024-12-27T11:31:44.421Z Has data issue: false hasContentIssue false
  • English
  • Français

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

Published online by Cambridge University Press:  10 September 2020

Sara Bouraine Open the ORCID record for Sara Bouraine [Opens in a new window]  and
Ouahiba Azouaoui
Sara Bouraine*
Affiliation:
Center for the Development of Advanced Technologies (CDTA), Baba Hassen, Algiers, Algeria
Ouahiba Azouaoui
Affiliation:
Center for the Development of Advanced Technologies (CDTA), Baba Hassen, Algiers, Algeria
*
*Corresponding author. E-mail: s_bouraine@yahoo.fr
Get access Rights & Permissions [Opens in a new window]

Summary

Robots 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.

Keywords

Particle swarm optimizationMotion planningMotion safetyMobile robotsDynamic environment
Type
Articles
Information
Robotica , Volume 39 , Issue 5 , May 2021 , pp. 885 - 927
Copyright
Copyright © The Author(s), 2020. Published by Cambridge University Press

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

Althoff, D., Kuffner, J. J., Wollherr, D. and Buss, M., “Safety assessment of robot trajectories for navigation in uncertain and dynamic environments,” Auton. Robots 32(3), 285–302 (2012).CrossRefGoogle Scholar
Bouraine, S., Fraichard, T. and Salhi, H., “Provably safe navigation for mobile robots with limited field-of-views in dynamic environments,” Auton. Robots 32(3), 267–283 (2012).CrossRefGoogle Scholar
Bouraine, S., Fraichard, T. and Salhi, H., “Provably Safe Navigation for Mobile Robots with Limited Field-of-Views in Unknown Dynamic Environments,” Proceedings of the IEEE/RSJ International Conference on Intelligent Robots and Systems (2011).CrossRefGoogle Scholar
Heon-Cheol, L., Touahmi, Y. and Beom-Hee, L., “Grafting: A path replanning technique for rapidly-exploring random trees in dynamic environments,” Adv. Robot. 26(18), 2145–2168 (2012).Google Scholar
van den Berg, J. and Overmars, M., “Roadmap-based motion planning in dynamic environments,” IEEE Trans. Robot. 21(5), 885–897 (2005).CrossRefGoogle Scholar
F. A.Yaghmaie, A. Mobarhani and H. D.Taghirad, “A New Method for Mobile Robot Navigation in Dynamic Environment: Escaping Algorithm,” Proceeding of the 2013 RSI/ISM International Conference on Robotics and Mechatronics (2013) pp. 212–217.Google Scholar
Seder, M. and Petrovic, I., “Dynamic Window Based Approach to Mobile Robot Motion Control in the Presence of Moving Obstacles,” IEEE International Conference on Robotics and Automation (2007).CrossRefGoogle Scholar
Wilkie, D., van den Berg, J. and Manocha, D., “Generalized Velocity Obstacles,” Proceedings of the IEEE/RSJ International Conference on Intelligent Robots and Systems (2009) pp. 5573–5578.Google Scholar
Bouraine, S., Fraichard, T., Azouaoui, O. and Salhi, H., “Passively Safe Partial Motion Planning for Mobile Robots with Limited Field-of-Views in Unknown Dynamic Environment,” IEEE International Conference on Robotics and Automation (2014) pp. 3576–3582.Google Scholar
Kennedy, J. and Eberhart, R., “Particle Swarm Optimization,” IEEE International Conference on Neural Networks, vol. 4 (1995) pp. 1942–1948.Google Scholar
Hager, M.C. and Helfman, G.S., “Safety in numbers: Shoal Size choice by minnows under predatory threat,” Behav. Ecol. Sociobiol. 29(4), 271–276 (1991).CrossRefGoogle Scholar
Fraichard, T., “Will the driver seat ever be empty?,” ERCIM News, ERCIM (2017) pp. 39–40.Google Scholar
Fraichard, T. and Asama, H., “Inevitable collision states. A step towards safer robots?,” Adv. Robot. 18(10), 1001–1024 (2004).CrossRefGoogle Scholar
M.A. bouguerra, T. Fraichard and M. Fezari, “Viability-based guaranteed safe robot navigation,” J. Intell. Robot. Syst. 95(2), 459–471 (2019).CrossRefGoogle Scholar
Blaich, M., Weber, S., Reuter, J. and Hahn, A., “Motion Safety for Vessels: An Approach Based on Inevitable Collision States,” IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS), 1077–1082 (2015).Google Scholar
Bohorquez, N., Sherikov, A., Dimitrov, D. and Wieber, P. B., “Safe Navigation Strategies for a Biped Robot Walking in a Crowd,” IEEE-RAS 16th International Conference on Humanoid Robots (Humanoids) (2016) pp. 379–386.Google Scholar
Snape, J., Berg, V., Guy, S. J. and Manocha, D., “Independent Navigation of Multiple Mobile Robots with Hybrid Reciprocal Velocity Obstacles,” Proceedings of the IEEE/RSJ International Conference on Intelligent Robots and Systems (2009) pp. 5917–5922.Google Scholar
Gopalakrishnan, B., Singh, A. and Krishna, K., “Time Scaled Collision Cone Based Trajectory Optimization Approach for Reactive Planning in Dynamic Environments,” Proceedings of the IEEE/RSJ International Conference on Intelligent Robots and Systems (2014) pp. 4169–4176.Google Scholar
Shuai, C., Junhao, X. and Huimin, L., “Real-Time Obstacle Avoidance Using Subtargets and Cubic B-spline for Mobile Robots,” IEEE International Conference on Information and Automation (ICIA) (2014) pp. 634–639.Google Scholar
Lu, Y., Xi, Z. and Lien, J. M., “Collision Prediction Among Polygons with Arbitrary Shape and Unknown Motion,” Proceedings of the IEEE/RSJ International Conference on Intelligent Robots and Systems (2014) pp. 4148–4153.Google Scholar
Lawitzky, A., Nicklas, A., Wollherr, D. and Buss, M., “Determining States of Inevitable Collision Using Reachability Analysis,” Proceedings of the IEEE/RSJ International Conference on Intelligent Robots and Systems (2014) pp. 4142–4147.Google Scholar
Pan, J., Zhang, L. and Manocha, D., “Collision-free and smooth trajectory computation in cluttered environments,” J. Robot. Res., 1155–1175 (2012).CrossRefGoogle Scholar
Sarid, S., Xu, B. and Kress-Gazit, H., “Guaranteeing High-Level Behaviors while Exploring Partially Known Maps,” In: Robotics: Science and Systems (MIT Press, 2013) pp. 377–384.Google Scholar
Taubig, H., Frese, U., Hertzberg, C., Mohr, S., Vorobev, E. and Walter, D., “Guaranteeing functional safety: design for provability and computer-aided verification,” Auton. Robots 32(3), 303–331 (2012).CrossRefGoogle Scholar
Pallottino, L., Scordio, V., Bicchi, A. and Frazzoli, E., “Decentralized cooperative policy for conflict resolution in multivehicle systems,” IEEE Trans. Robot. 23(6), 1170–1183 (2007).CrossRefGoogle Scholar
Van den Berg, J. and Overmars, M., “Planning time-minimal safe paths amidst unpredictably moving obstacles,” Int. J. Robot. Res. 27(11–12), 1274–1294 (2008).CrossRefGoogle Scholar
Lalish, E. and Morgansen, K., “Decentralized Reactive Collision Avoidance for Multivehicle Systems,” IEEE Conference on Decision and Control (2008).CrossRefGoogle Scholar
Bekris, K., Tsianos, K. and Kavraki, L., “Safe and Distributed Kinodynamic Replanning for Vehicular Networks Mobile Networks and Applications,” IEEE Conference on Decision and Control, vol. 14(3) (2009).CrossRefGoogle Scholar
Hsu, D., Kindel, R., Latombe, J.C. and Rock, S., “Randomized kinodynamic motion planning with moving obstacles,” Int. J. Robot. Res. 21(3), 233–255 (2002).CrossRefGoogle Scholar
Bekris, K. and Kavraki, L., “Greedy but Safe Replanning under Kinodynamic Constraints,” IEEE International Conference on Robotics and Automation (2007).CrossRefGoogle Scholar
Seward, D., Pace, C. and Agate, R., “Safe and Effective Navigation of Autonomous Robots in Hazardous Environments Autonomous Robots,” IEEE International Conference on Robotics and Automation, vol. 22 (2007) pp. 223–242.Google Scholar
van den Berg, J., Abbeel, P. and Goldberg, K., “LQG-MP: Optimized Path Planning for Robots with Motion Uncertainty and Imperfect State Information,” Robot. Sci. Syst. 30(7), 895–913 (2011).Google Scholar
LaValle, S. and Kuffner, J., “Randomized kinodynamic planning,” Int. J. Robot. Res. 20(5), 378–400 (2001).CrossRefGoogle Scholar
Macek, K., Vasquez-Govea, D., Fraichard, T. and Siegwart, R., “Towards safe vehicle navigation in dynamic urban scenarios,” Automatika 50(3–4), 184–194 (2009).Google Scholar
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.Google Scholar
Kurniawati, H. and Fraichard, T., “From Path to Trajectory Deformation,” Proceedings of the IEEE/RSJ International Conference on Intelligent Robots and Systems (2007) pp. 159–164.Google Scholar
Delsart, V. and Fraichard, T., “Navigating Dynamic Environments Using Trajectory Deformation,” Proceedings IEEE International Conference on Intelligent Robots and Systems (2008) pp. 226–233.Google Scholar
Horwood, J., Aragon, N. and Poore, A., “Gaussian sum filters for space surveillance: Theory and simulation,” J. Guid. Control Dynam. 34(6), 1839–1851 (2011).CrossRefGoogle Scholar
Bestaoui Sebbane, Y., “Planning and decision making for aerial robots,” Intell. Syst. Cont. Autom. Sci. Eng. 71 (2014).CrossRefGoogle Scholar
Stentz, A., “The Focussed d* Algorithm for Real-Time Replanning,” Proceedings of the International Joint Conference on Artificial Intelligence (1995) pp. 1652–1659.Google Scholar
Ferguson, D. and Stentz, A., “Anytime RRTs,” Proceedings of the IEEE/RSJ International Conference on Intelligent Robots and Systems (2006) pp. 5369–5375.Google Scholar
Zucker, M., Kuffner, J. and Branicky, M., “Multipartite RRTs for Rapid Replanning in Dynamic Environments,” IEEE International Conference on Robotics and Automation (2007) pp. 1603–1609.Google Scholar
Macek, K., Becked, M. and Siegwart, R., “Motion Planning for Car-Like Vehicles in Dynamic Urban Scenarios,” IEEE/RSJ International Conference on Intelligent Robots and Systems (2006) pp. 4375–4380.Google Scholar
Heon-Cheol, L., Touahmi, Y. and Beom-Hee, L., “Grafting: A path replanning technique for rapidly exploring random trees in dynamic environments,” Adv. Robot. 26(18), 2145–2168 (2012).Google Scholar
Ma, L., Xue, J., Kawabata, K., Zhu, J., Ma, C. and Zheng, N., “Efficient sampling-based motion planning for on-road autonomous driving,” IEEE Trans. Intell. Transp. Syst. 16(4), 1961–1976 (2015).CrossRefGoogle Scholar
Karaman, S., and Frazzoli, E., “Sampling based algorithms for optimal motion planning,” Int. J. Robot. Res. 16, 846–894 (2011).CrossRefGoogle Scholar
Fraichard, T. and Howard, T., “ Iterative Motion Planning and Safety Issue, ” In: Handbook of Intelligent Vehicles (Springer, 2012) pp. 1433–1458.CrossRefGoogle Scholar
Kelly, A. and Stentz, T., “Rough terrain autonomous mobility - Part 2: An active vision and predictive control approach,” Auton. Robots 5(2), 163–198 (1998).CrossRefGoogle Scholar
Kelly, A., Stentz, T., Amidi, O., Bode, M., Bradley, D., Mandelbaum, R., Pilarski, T., Rander, P., Thayer, S., Vallidis, N. and Warner, R., “Toward reliable off-road autonomous vehicles operating in challenging environments,” Int. J. Robot. Res. 25(5–6), 449–483 (2006).CrossRefGoogle Scholar
Knepper, R., Srinivasa, S. and Mason, M., “An Equivalent Relation for Local Path Sets,” Proceedings of the Ninth International Workshop on the Algorithmic Foundations of Robotics, vol. 68 (2010) pp. 19–35.Google Scholar
Howard, T., Green, C., Kelly, A. and Ferguson, D., “State space sampling of feasible motions for high performance mobile robot navigation in complex environments,” J. Field Robot. 25(6–7), 325–345 (2008).CrossRefGoogle Scholar
von Hundelshausen, F., Himmelsbach, M., Hecker, F., A. Mueller and H.-J. Wuensche “Driving with tentacles-integral structures of sensing and motion,” J. Field Robot., 64–673 (2008).CrossRefGoogle Scholar
Cherubini, A., Spindler, F. and Chaumette, F., “A New Tentacles-Based Technique for Avoiding Obstacles During Visual Navigation,” IEEE International Conference on Robotics and Automation, vol. 20 (2012) pp. 4850–4855.Google Scholar
Oliver, B. and Khatib, O., “High-Speed Navigation Using the Global Dynamic Window Approach,” IEEE International Conference on Robotics and Automation, vol. 1 (1999).Google Scholar
Demeester, E., Nuttin, M., Vanhooydonck, D., Vanacker, G. and Van Brussel, H., “Global dynamic window approach for holonomic and non-holonomic mobile robots with arbitrary cross-section,” IEEE Trans. Netw., Neural , 2357–2362 (2005).CrossRefGoogle Scholar
Petti, S. and Fraichard, T., “Safe Motion Planning in Dynamic Environments,” Proceeding of the IEEE-RSJ International Conference on Intelligent Robots and Systems (2005) pp. 2210–2215.Google Scholar
Richalet, J., Rault, A., Testud, T. and Papon, J., “Model predictive heuristic control: Applications to industrial processes,” Automatica 14(5), 413–428 (1978).CrossRefGoogle Scholar
Farrokhsiar, M. and Najjaran, H., “Unscented Predictive Motion Planning of a Nonholonomic System,” IEEE International Conference on Robotics and Automation (2011) pp. 4480–4485.Google Scholar
Maniatopoulos, S., Panagou, D. and Kyriakopoulos, K., “Model Predictive Control for the Navigation of a Nonholonomic Vehicle with Field-of-View Constraints,” American Control Conference (ACC) (2013) pp. 3967–3972.Google Scholar
Hoy, M., and A. S. Matveev and A. V. Savkin, “Algorithms for collision-free navigation of mobile robots in complex cluttered environments: a survey,” Robotica 33(3), 463–497 (2015).Google Scholar
Hart, P., Nilsson, N. and Raphael, B., “Formal basis for the heuristic determination of minimum cost paths,” IEEE Trans. Syst. Sci. Cybern. 4(2), 100–107 (1968).Google Scholar
Dijkstra, E. W., “A note on two problems in connexion with graphs,” Numer. Math. 1(1), 269–271 (1959).CrossRefGoogle Scholar
Kalakrishnan, M., Chitta, S., Theodorou, E., Pastor, P. and Schaal, S., “STOMP: Stochastic Trajectory Optimization for Motion Planning,” IEEE International Conference on Robotics and Automation (2011) pp. 4569–4574.Google Scholar
Ratliff, N. D., Zucker, M., Bagnell, J. A. and Srinivasa, S. S., “CHOMP: Gradient Optimization Techniques for Efficient Motion Planning,” IEEE International Conference on Robotics and Automation (2009) pp. 489–494.Google Scholar
Zucker, M., Ratliff, N., Dragan, A. D., Pivtoraiko, M., Klingensmith, M., Dellin, C. M., Bagnell, J. A. and Srinivasa, S. S., “CHOMP: Covariant Hamiltonian optimization for motion planning,” Int. J. Robot. Res. 32(9–10), 1164–1193 (2013).CrossRefGoogle Scholar
Michalewicz, Z., Genetic Algorithms + Data Structures = Evolution Programs (Springer, New York, NY, USA, 1996).CrossRefGoogle Scholar
Colorni, A., Dorigo, M. and Maniezzo, V., “Distributed Optimization by Ant Colonies,” European Conference on Artificial Life, France (1991) pp. 134–142.Google Scholar
Dorigo, M., Optimization, Learning and Natural Algorithms (Politecnico di Milano, Italie, 1992).Google Scholar
Freeman, J. and Skapura, D., Neural Networks: Algorithms, Applications and Programming Techniques (Addison Wesley, 1991).Google Scholar
Ghorbani, A., “Using Genetic Algorithm for a Mobile Robot Path Planning,” International Conference on Future Computer and Communication (2009) pp. 164–166.Google Scholar
Sugawara, K., “Foraging Behavior of Interacting Robots with Virtual Pheromone,” Proceedings of the International Conference on Intelligent Robots and Systems, vol. 3 (2004) pp. 3074–3079.Google Scholar
Qu, H., “Real-time robot path planning based on a modified pulse-coupled neural network model,” IEEE Trans. Netw, Neural . 20(11), 1724–1739 (2009).Google ScholarPubMed
Chen, X. and Li, Y., “Smooth Path Planning of a Mobile Robot Using Stochastic Particle Swarm Optimization,” Proceedings of the IEEE International Conference on Mechatronics and Automation (2006) pp. 1722–1727.Google Scholar
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.Google Scholar
Bonyadi, M. R. and Michalewicz, Z., “Particle swarm optimization for single objective continuous space problems: A review,” Evol. Comput. 25(1), 1–54 (2016).CrossRefGoogle ScholarPubMed
Munemoto, M., Takai, Y. and Sato, Y., “A Migration Scheme for Genetic Adaptive Routing Algorithm,” IEEE International Conference on Systems, Man, and Cybernetics (1998) pp. 2774–2779.Google Scholar
Inagaki, J., Haseyama, M. and Kitajima, H., “A genetic Algorithm for Determining Multiple Routes and Its Applications,” IEEE International Symposium on Circuits and Systems (1999) pp. 137–140.Google Scholar
Ahn, C. and Ramakrishna, R., “A Genetic Algorithm for Shortest Path Routing Problem and the Sizing of Populations,” IEEE Trans. Evol. Comput., 566–579 (2002).CrossRefGoogle Scholar
Gen, M., Cheng, R. and Wang, D., “Genetic Algorithms for Solving Shortest Path Problems,” Proceeding of the IEEE International Conference on Evolutionary Computation (1997) pp. 401–406.Google Scholar
Raidl, G., “A Weighted Coding in a Genetic Algorithm for the Degree Constrained Minimum Spanning Tree Problem,” Proceeding of the 2000 ACM Symposium on Applied Computing (2000) pp. 440–445.Google Scholar
Mohemmed, A. W. and Sahoo, N. C., “Particle Swarm Optimization Combined with Local Search and Velocity Re-Initialization for Shortest Path Computation in Networks,” Proceedings of the 2007 IEEE Swarm Intelligence Symposium (2007) pp. 266–272.Google Scholar
Mohemmed, A. W. and Sahoo, N. C., “Efficient Computation of Shortest Paths in Networks Using Particle Swarm Optimization and Noising Metaheuristics,” Discrete Dynamics in Nature and Society (2007) pp. 1–25.Google Scholar
Ragavan, S. V., Ponnambalam, S. G. and Sumero, C., “Waypoint-Based Path Planner for Mobile Robot Navigation Using PSO and GA-AIS,” 2011 IEEE Recent Advances in Intelligent Computational Systems (2011) pp. 756–760.Google Scholar
Su, K., Y. Wang and X. Hu “Middle node optimization algorithm for global optimal path planning,” Int. J. Adv. Comput. Sci. Appl. (IJACSA) 6(4) (2015).Google Scholar
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.Google Scholar
Althoff, D., Althoff, M., D. Wollherr and M. Boss “Probabilistic Collision State Checker for Crowded Environments,” IEEE International Conference on Robotics and Automation (2010) pp. 1492–1498.Google Scholar
Fraichard, T. and Howard, T. M. “Iterative Motion Planning and Safety Issue,” In: Handbook of Intelligent Vehicles (Springer, London, 2012) pp. 1433–1458.CrossRefGoogle Scholar
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.Google Scholar
Vasquez, D., Fraichard, T. and Laugier, C., “Growing hidden Markov models: An incremental tool for learning and predicting human and vehicle motion,”Int. J. Robot. Res. 28(11–12), 1486–1506 (2009).CrossRefGoogle Scholar
Broadhurstr, A., Baker, S. and Kanade, T. “Monte Carlo Road Safety Reasoning,” Proceedings IEEE Intelligent Vehicles Symposium (2005) pp. 319–324.Google Scholar
Kushleyev, A. and Likhachev, M. “Time-Bounded Lattice for Efficient Planning in Dynamic Environments,” IEEE International Conference on Robotics and Automation (2009) pp. 1662–1668.Google Scholar
Schouwenaars, T., “Safe Trajectory Planning of Autonomous Vehicles,” Thesis (Massachusetts Institute of Technology, 2006).Google Scholar
Shi, Y. and Eberhart, R., “A Modified Particle Swarm Optimizer,” IEEE World Congress on Computational Intelligence (1998) pp. 69–73.Google Scholar
Fraichard, T., “A Short Paper About Motion Safety,” IEEE International Conference on Robotics and Automation (ICRA) (2007) pp. 1140–1145.Google Scholar
Ferguson, D. and Stentz, A., “Field D*: An Interpolation-Based Path Planner and Replanner,” Carnegie Mellon Robotics Institute, Technical Report (CMU-RI-TR-05-19, 2005).Google Scholar
Mitsch, S., Ghorbal, K and Platzer, A.,“On provably safe obstacle avoidance for autonomous robotic ground vehicles,” Robotics Science and Systems (RSS) (2013).CrossRefGoogle Scholar