A Performance Review of Collision-Free Path Planning Algorithms
Path planning for mobile agents is one of the areas that has drawn the attention of researchers’, as evidenced in the large number of papers related to the collision-free path planning (CFPP) algorithm. The purpose of this paper is to review the findings of those CFPP papers and the methodologies us...
Saved in:
| Published in: | Electronics (Basel) Vol. 9; no. 2; p. 316 |
|---|---|
| Main Authors: | , |
| Format: | Journal Article |
| Language: | English |
| Published: |
01.02.2020
|
| ISSN: | 2079-9292, 2079-9292 |
| Online Access: | Get full text |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Abstract | Path planning for mobile agents is one of the areas that has drawn the attention of researchers’, as evidenced in the large number of papers related to the collision-free path planning (CFPP) algorithm. The purpose of this paper is to review the findings of those CFPP papers and the methodologies used to generate possible solutions for CFPP for mobile agents. This survey shows that the previous CFPP papers can be divided based on four characteristics. The performance of each method primarily used to solve CFPP in previous research is evaluated and compared. Several methods are implemented and tested in same computing environment to compare the performance of generating solution in specified spatial environment with different obstacles or size. The strengths and weakness of each methodology for CFPP are shown through this survey. Ideally, this paper will provide reference for new future research. |
|---|---|
| AbstractList | Path planning for mobile agents is one of the areas that has drawn the attention of researchers’, as evidenced in the large number of papers related to the collision-free path planning (CFPP) algorithm. The purpose of this paper is to review the findings of those CFPP papers and the methodologies used to generate possible solutions for CFPP for mobile agents. This survey shows that the previous CFPP papers can be divided based on four characteristics. The performance of each method primarily used to solve CFPP in previous research is evaluated and compared. Several methods are implemented and tested in same computing environment to compare the performance of generating solution in specified spatial environment with different obstacles or size. The strengths and weakness of each methodology for CFPP are shown through this survey. Ideally, this paper will provide reference for new future research. |
| Author | Chae, Junjae Shin, Hyunwoo |
| Author_xml | – sequence: 1 givenname: Hyunwoo orcidid: 0000-0002-3986-2199 surname: Shin fullname: Shin, Hyunwoo – sequence: 2 givenname: Junjae orcidid: 0000-0002-2657-047X surname: Chae fullname: Chae, Junjae |
| BookMark | eNp9kM1KxDAUhYOM4DjOC7jKC1Tz15-spAyOCgMW0XVJ05uZSJpIEhTf3oouRMGzuYcD3-VwTtHCBw8InVNywbkkl-BA5xi81UkSRjitjtCSkVoWkkm2-OFP0DqlZzJLUt5wskRXLe4gmhAn5TXgB3i18IaDwZvgnE02-GIbAXCn8gF3Tnlv_R63bh-izYcpnaFjo1yC9fddoaft9ePmttjd39xt2l2hmaS5oLzU4zCIEkpeaVMCpWosy5rSOTdSUSWMFEoMUjRjQ8dhrjiKsTF1LaqqNnyFmq-_OoaUIphe26zy3C9HZV1PSf-5Rf93ixllv9CXaCcV3_-DPgBppmh2 |
| CitedBy_id | crossref_primary_10_1109_ACCESS_2021_3055231 crossref_primary_10_1016_j_matcom_2022_01_010 crossref_primary_10_3390_electronics11111734 crossref_primary_10_1007_s12652_022_04098_z crossref_primary_10_1016_j_jpdc_2022_06_014 crossref_primary_10_1051_smdo_2021024 crossref_primary_10_1155_2021_5512229 crossref_primary_10_3390_wevj15070296 crossref_primary_10_3390_app132212114 crossref_primary_10_1007_s10462_022_10257_7 crossref_primary_10_3390_electronics11172667 crossref_primary_10_1016_j_eswa_2023_120942 crossref_primary_10_1155_2021_5524232 crossref_primary_10_3390_app10165613 crossref_primary_10_4271_2021_01_0251 crossref_primary_10_3390_s21165649 crossref_primary_10_1186_s10033_022_00798_x |
| Cites_doi | 10.1177/0278364915615688 10.4304/jcp.6.8.1554-1561 10.1109/ISDA.2006.253908 10.1016/j.robot.2019.02.002 10.1016/j.techfore.2018.09.013 10.1007/s10586-018-2360-3 10.1017/CBO9780511546877 10.1177/027836402320556421 10.1177/0278364917714338 10.1109/ICIT.2010.5472755 10.1016/S0957-4174(98)00055-4 10.1016/j.eswa.2010.08.084 10.1007/s10846-009-9383-1 10.1109/70.660866 10.2514/6.2007-1881 10.1109/ISVD.2007.43 10.1109/ROBOT.1986.1087622 10.1109/ICNSC.2009.4919259 10.1177/027836402320556458 10.1145/359156.359164 10.1109/TCST.2008.917870 10.1016/0196-6774(85)90021-5 10.1016/j.autcon.2017.04.013 10.1109/2.16221 10.15607/RSS.2007.III.030 10.1109/CIRA.2009.5423161 10.1109/SFCS.1979.10 10.1109/TCST.2008.2012116 10.1146/annurev-control-060117-105157 10.1017/S0263574714001234 10.1007/s13042-017-0703-7 10.1109/ICCDA.2010.5541300 10.1109/TRO.2010.2042990 10.1109/TSMCB.2011.2107899 10.3390/s19040815 10.1002/rob.4620070107 10.3390/electronics7100212 10.1023/A:1014463014150 10.1109/ROBOT.2000.844107 10.1109/ACCESS.2018.2812896 10.1109/TII.2012.2198665 10.1109/ICARCV.2008.4795701 10.1155/2013/705238 10.1177/0278364904045481 10.1177/1729881418774673 10.1109/ICRA.2018.8460730 10.3844/jcssp.2008.341.344 10.1109/TSMCA.2011.2159586 10.1016/j.robot.2016.08.001 10.1109/PACIIA.2008.376 10.1007/978-3-319-60916-4_20 10.1109/IROS.2010.5650789 10.1109/TSSC.1968.300136 10.1016/j.asoc.2009.02.014 10.1016/j.compeleceng.2012.06.016 10.1016/j.proeng.2014.12.098 10.1016/j.asoc.2017.10.025 10.1007/BF01386390 10.1007/s11786-012-0123-8 10.1016/0004-3702(88)90053-7 10.1109/ACCESS.2018.2886245 10.1016/j.ejor.2016.08.032 10.15837/ijccc.2015.5.2030 10.1007/s00542-016-3192-9 10.1177/0278364911406761 10.1145/136035.136037 10.1016/j.asoc.2015.01.067 10.1016/S0004-3702(01)00069-8 10.1016/j.procs.2018.01.113 10.1016/j.jocs.2018.02.004 10.1177/0278364906067174 10.1049/joe.2018.8266 10.1109/ICUAS.2013.6564702 10.1002/rob.4620110302 10.1109/SCORED.2006.4339335 10.1109/ICRA.2011.5980555 10.1007/s10514-005-4748-1 10.1177/0278364906061705 10.1109/ICMA.2006.257474 10.1109/TEVC.2018.2878221 10.1109/SFCS.1988.21947 10.1007/978-3-319-29363-9_24 10.1109/70.508439 10.1109/21.148404 10.1016/j.eswa.2018.08.008 10.1016/j.asoc.2011.11.011 10.1002/cpa.3160360305 10.1109/TVT.2018.2882130 10.1016/j.neucom.2012.09.019 |
| ContentType | Journal Article |
| DBID | AAYXX CITATION |
| DOI | 10.3390/electronics9020316 |
| DatabaseName | CrossRef |
| DatabaseTitle | CrossRef |
| DatabaseTitleList | CrossRef |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Engineering |
| EISSN | 2079-9292 |
| ExternalDocumentID | 10_3390_electronics9020316 |
| GroupedDBID | 5VS 8FE 8FG AAYXX ADMLS AFFHD AFKRA ALMA_UNASSIGNED_HOLDINGS ARAPS BENPR BGLVJ CCPQU CITATION HCIFZ IAO KQ8 MODMG M~E OK1 P62 PHGZM PHGZT PIMPY PQGLB PROAC |
| ID | FETCH-LOGICAL-c291t-135cdbb45e536cf5e11ad557115cdf9a1a4f94a4b948d81db000d4d8f774667f3 |
| ISICitedReferencesCount | 19 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000518412200116&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| ISSN | 2079-9292 |
| IngestDate | Sat Nov 29 07:17:18 EST 2025 Tue Nov 18 21:55:29 EST 2025 |
| IsDoiOpenAccess | false |
| IsOpenAccess | true |
| IsPeerReviewed | true |
| IsScholarly | true |
| Issue | 2 |
| Language | English |
| LinkModel | OpenURL |
| MergedId | FETCHMERGED-LOGICAL-c291t-135cdbb45e536cf5e11ad557115cdf9a1a4f94a4b948d81db000d4d8f774667f3 |
| ORCID | 0000-0002-3986-2199 0000-0002-2657-047X |
| OpenAccessLink | https://www.mdpi.com/2079-9292/9/2/316/pdf?version=1583070285 |
| ParticipantIDs | crossref_citationtrail_10_3390_electronics9020316 crossref_primary_10_3390_electronics9020316 |
| PublicationCentury | 2000 |
| PublicationDate | 2020-02-01 |
| PublicationDateYYYYMMDD | 2020-02-01 |
| PublicationDate_xml | – month: 02 year: 2020 text: 2020-02-01 day: 01 |
| PublicationDecade | 2020 |
| PublicationTitle | Electronics (Basel) |
| PublicationYear | 2020 |
| References | ref_93 ref_90 Babinec (ref_63) 2014; 96 Birattari (ref_122) 2016; 3 ref_11 ref_99 Hart (ref_53) 1968; 4 ref_98 ref_17 ref_15 Masehian (ref_10) 2007; 29 Saha (ref_40) 2005; 19 Latombe (ref_35) 2002; 21 Gong (ref_96) 2011; 6 ref_24 Zhao (ref_72) 1994; 11 ref_120 ref_22 Xiong (ref_118) 2019; 115 ref_21 Garcia (ref_109) 2009; 9 Yap (ref_16) 1985; 6 Nazarahari (ref_79) 2019; 115 ref_28 ref_27 Yu (ref_113) 2019; 23 Solovey (ref_38) 2016; 35 Ma (ref_121) 2019; 68 Zhang (ref_94) 2013; 103 Kuwata (ref_34) 2009; 17 Phung (ref_102) 2017; 81 Karaman (ref_44) 2011; 30 Shiltagh (ref_103) 2013; 2 ref_71 ref_70 Yang (ref_68) 2018; 6 Fu (ref_64) 1990; 7 ref_78 ref_77 Schwartz (ref_3) 1983; 36 ref_74 Kavraki (ref_19) 1998; 14 Bottasso (ref_47) 2008; 16 Tharwat (ref_46) 2019; 22 Thabit (ref_106) 2019; 7 ref_83 ref_82 ref_81 ref_80 Amer (ref_91) 2019; 142 ref_89 ref_85 Gasparetto (ref_4) 2012; 6 ref_84 Deng (ref_62) 2012; 12 Wang (ref_101) 2015; 10 ref_50 Cai (ref_67) 2002; 33 MahmoudZadeh (ref_73) 2018; 70 Yen (ref_110) 2018; 24 Saha (ref_41) 2006; 25 Sharir (ref_6) 1989; 22 Schwarting (ref_14) 2018; 1 ref_58 ref_57 ref_55 Mohanty (ref_18) 2013; 1 ref_54 Tuncer (ref_76) 2012; 38 (ref_86) 1998; 15 Janson (ref_56) 2018; 37 ref_59 Hwang (ref_8) 1992; 24 Kavraki (ref_29) 1996; 12 Wesley (ref_2) 1979; 22 Kim (ref_32) 2016; 34 ref_61 ref_60 Miao (ref_88) 2013; 222 ref_69 ref_65 (ref_25) 1983; 32 Song (ref_92) 2019; 10 Hsu (ref_43) 2006; 25 Roberge (ref_12) 2012; 9 ref_115 Alexopoulos (ref_20) 1992; 22 ref_114 ref_117 ref_116 ref_119 Fu (ref_95) 2011; 42 LaValle (ref_26) 2004; 23 ref_36 ref_33 ref_111 ref_31 ref_112 Lamini (ref_75) 2018; 127 Yang (ref_48) 2010; 26 ref_39 Xing (ref_107) 2011; 41 ref_37 Tavares (ref_87) 2011; 38 Jiao (ref_108) 2018; 25 ref_104 ref_105 Sheta (ref_66) 2008; 4 ref_45 ref_100 ref_42 Saska (ref_97) 2006; 19 (ref_1) 2018; 264 Thrun (ref_23) 2001; 128 Schwartz (ref_7) 1988; 37 Hsu (ref_30) 2002; 21 ref_49 ref_9 Mac (ref_13) 2016; 86 ref_5 (ref_51) 2015; 30 Dijkstra (ref_52) 1959; 1 |
| References_xml | – ident: ref_117 – volume: 35 start-page: 501 year: 2016 ident: ref_38 article-title: Finding a needle in an exponential haystack: Discrete RRT for exploration of implicit roadmaps in multi-robot motion planning publication-title: Int. J. Robot. Res. doi: 10.1177/0278364915615688 – volume: 6 start-page: 1554 year: 2011 ident: ref_96 article-title: Multi-objective Particle Swarm Optimization for Robot Path Planning in Environment with Danger Sources publication-title: J. Comput. doi: 10.4304/jcp.6.8.1554-1561 – ident: ref_81 doi: 10.1109/ISDA.2006.253908 – volume: 115 start-page: 90 year: 2019 ident: ref_118 article-title: Path planning of multiple autonomous marine vehicles for adaptive sampling using Voronoi-based ant colony optimization publication-title: Robot. Auton. Syst. doi: 10.1016/j.robot.2019.02.002 – volume: 142 start-page: 235 year: 2019 ident: ref_91 article-title: Centralized simulated annealing for alleviating vehicular congestion in smart cities publication-title: Technol. Forecast. Soc. Chang. doi: 10.1016/j.techfore.2018.09.013 – ident: ref_80 – volume: 22 start-page: 4745 year: 2019 ident: ref_46 article-title: Intelligent Bézier curve-based path planning model using Chaotic Particle Swarm Optimization algorithm publication-title: Clust. Comput. doi: 10.1007/s10586-018-2360-3 – ident: ref_17 doi: 10.1017/CBO9780511546877 – volume: 21 start-page: 233 year: 2002 ident: ref_30 article-title: Randomized Kinodynamic Motion Planning with Moving Obstacles publication-title: Int. J. Robot. Res. doi: 10.1177/027836402320556421 – volume: 37 start-page: 46 year: 2018 ident: ref_56 article-title: Deterministic sampling-based motion planning: Optimality, complexity, and performance publication-title: Int. J. Robot. Res. doi: 10.1177/0278364917714338 – ident: ref_39 – ident: ref_100 doi: 10.1109/ICIT.2010.5472755 – volume: 15 start-page: 421 year: 1998 ident: ref_86 article-title: Mobile robot path planning and tracking using simulated annealing and fuzzy logic control publication-title: Expert Syst. Appl. doi: 10.1016/S0957-4174(98)00055-4 – volume: 38 start-page: 2951 year: 2011 ident: ref_87 article-title: Simulated annealing with adaptive neighborhood: A case study in off-line robot path planning publication-title: Expert Syst. Appl. doi: 10.1016/j.eswa.2010.08.084 – ident: ref_11 doi: 10.1007/s10846-009-9383-1 – ident: ref_42 – ident: ref_71 – volume: 14 start-page: 166 year: 1998 ident: ref_19 article-title: Analysis of probabilistic roadmaps for path planning publication-title: IEEE Trans. Robot. Autom. doi: 10.1109/70.660866 – ident: ref_77 – ident: ref_93 doi: 10.2514/6.2007-1881 – ident: ref_54 doi: 10.1109/ISVD.2007.43 – ident: ref_114 – ident: ref_31 – ident: ref_120 – ident: ref_58 doi: 10.1109/ROBOT.1986.1087622 – ident: ref_89 doi: 10.1109/ICNSC.2009.4919259 – ident: ref_83 – volume: 21 start-page: 5 year: 2002 ident: ref_35 article-title: On Delaying Collision Checking in PRM Planning: Application to Multi-Robot Coordination publication-title: Int. J. Robot. Res. doi: 10.1177/027836402320556458 – volume: 22 start-page: 560 year: 1979 ident: ref_2 article-title: An algorithm for planning collision-free paths among polyhedral obstacles publication-title: Commun. ACM doi: 10.1145/359156.359164 – volume: 3 start-page: 43 year: 2016 ident: ref_122 article-title: The irace package: Iterated racing for automatic algorithm configuration publication-title: Oper. Res. Perspect. – volume: 16 start-page: 1152 year: 2008 ident: ref_47 article-title: Path Planning for Autonomous Vehicles by Trajectory Smoothing Using Motion Primitives publication-title: IEEE Trans. Control. Syst. Technol. doi: 10.1109/TCST.2008.917870 – volume: 6 start-page: 104 year: 1985 ident: ref_16 article-title: A “retraction” method for planning the motion of a disc publication-title: J. Algorithms doi: 10.1016/0196-6774(85)90021-5 – volume: 81 start-page: 25 year: 2017 ident: ref_102 article-title: Enhanced discrete particle swarm optimization path planning for UAV vision-based surface inspection publication-title: Autom. Constr. doi: 10.1016/j.autcon.2017.04.013 – volume: 22 start-page: 9 year: 1989 ident: ref_6 article-title: Algorithmic motion planning in robotics publication-title: Computer doi: 10.1109/2.16221 – ident: ref_50 doi: 10.15607/RSS.2007.III.030 – ident: ref_55 doi: 10.1109/CIRA.2009.5423161 – ident: ref_15 doi: 10.1109/SFCS.1979.10 – volume: 17 start-page: 1105 year: 2009 ident: ref_34 article-title: Real-Time Motion Planning With Applications to Autonomous Urban Driving publication-title: IEEE Trans. Control Syst. Technol. doi: 10.1109/TCST.2008.2012116 – volume: 1 start-page: 187 year: 2018 ident: ref_14 article-title: Planning and Decision-Making for Autonomous Vehicles publication-title: Annu. Rev. Control Robot. Auton. Syst. doi: 10.1146/annurev-control-060117-105157 – volume: 34 start-page: 202 year: 2016 ident: ref_32 article-title: Tangent bundle RRT: A randomized algorithm for constrained motion planning publication-title: Robotica doi: 10.1017/S0263574714001234 – volume: 10 start-page: 107 year: 2019 ident: ref_92 article-title: A new approach to smooth global path planning of mobile robots with kinematic constraints publication-title: Int. J. Mach. Learn. Cybern. doi: 10.1007/s13042-017-0703-7 – ident: ref_115 doi: 10.1109/ICCDA.2010.5541300 – volume: 26 start-page: 561 year: 2010 ident: ref_48 article-title: An Analytical Continuous-Curvature Path-Smoothing Algorithm publication-title: IEEE Trans. Robot. doi: 10.1109/TRO.2010.2042990 – volume: 41 start-page: 1110 year: 2011 ident: ref_107 article-title: A Hybrid Ant Colony Optimization Algorithm for the Extended Capacitated Arc Routing Problem publication-title: IEEE Trans. Syst. Man Cybern. Part. B (Cybern.) doi: 10.1109/TSMCB.2011.2107899 – volume: 222 start-page: 420 year: 2013 ident: ref_88 article-title: Dynamic robot path planning using an enhanced simulated annealing approach publication-title: Appl. Math. Comput. – ident: ref_119 doi: 10.3390/s19040815 – volume: 7 start-page: 129 year: 1990 ident: ref_64 article-title: An efficient algorithm for finding a collision-free path among polyhedral obstacles publication-title: J. Robot. Syst. doi: 10.1002/rob.4620070107 – ident: ref_33 – ident: ref_74 doi: 10.3390/electronics7100212 – volume: 33 start-page: 61 year: 2002 ident: ref_67 article-title: Cooperative coevolutionary adaptive genetic algorithm in path planning of cooperative multi-mobile robot systems publication-title: J. Intell. Robot. Syst. Theory Appl. doi: 10.1023/A:1014463014150 – ident: ref_59 doi: 10.1109/ROBOT.2000.844107 – ident: ref_36 – volume: 6 start-page: 13671 year: 2018 ident: ref_68 article-title: Optimal UAV Path Planning: Sensing Data Acquisition Over IoT Sensor Networks Using Multi-Objective Bio-Inspired Algorithms publication-title: IEEE Access doi: 10.1109/ACCESS.2018.2812896 – ident: ref_22 – volume: 9 start-page: 132 year: 2012 ident: ref_12 article-title: Comparison of Parallel Genetic Algorithm and Particle Swarm Optimization for Real-Time UAV Path Planning publication-title: IEEE Trans. Ind. Inform. doi: 10.1109/TII.2012.2198665 – ident: ref_85 doi: 10.1109/ICARCV.2008.4795701 – ident: ref_98 doi: 10.1155/2013/705238 – ident: ref_78 – volume: 23 start-page: 673 year: 2004 ident: ref_26 article-title: On the Relationship between Classical Grid Search and Probabilistic Roadmaps publication-title: Int. J. Robot. Res. doi: 10.1177/0278364904045481 – ident: ref_49 – ident: ref_112 doi: 10.1177/1729881418774673 – ident: ref_28 doi: 10.1109/ICRA.2018.8460730 – volume: 4 start-page: 341 year: 2008 ident: ref_66 article-title: A Mobile Robot Path Planning Using Genetic Algorithm in Static Environment publication-title: J. Comput. Sci. doi: 10.3844/jcssp.2008.341.344 – ident: ref_84 – volume: 42 start-page: 511 year: 2011 ident: ref_95 article-title: Phase Angle-Encoded and Quantum-Behaved Particle Swarm Optimization Applied to Three-Dimensional Route Planning for UAV publication-title: IEEE Trans. Syst. Man Cybern. Part. A Syst. Hum. doi: 10.1109/TSMCA.2011.2159586 – volume: 86 start-page: 13 year: 2016 ident: ref_13 article-title: Heuristic approaches in robot path planning: A survey publication-title: Robot. Auton. Syst. doi: 10.1016/j.robot.2016.08.001 – ident: ref_104 doi: 10.1109/PACIIA.2008.376 – ident: ref_24 doi: 10.1007/978-3-319-60916-4_20 – ident: ref_65 doi: 10.1109/IROS.2010.5650789 – volume: 4 start-page: 100 year: 1968 ident: ref_53 article-title: A Formal Basis for the Heuristic Determination of Minimum Cost Paths publication-title: IEEE Trans. Syst. Sci. Cybern. doi: 10.1109/TSSC.1968.300136 – ident: ref_90 – ident: ref_61 – volume: 9 start-page: 1102 year: 2009 ident: ref_109 article-title: Path planning for autonomous mobile robot navigation with ant colony optimization and fuzzy cost function evaluation publication-title: Appl. Soft Comput. doi: 10.1016/j.asoc.2009.02.014 – volume: 38 start-page: 1564 year: 2012 ident: ref_76 article-title: Dynamic path planning of mobile robots with improved genetic algorithm publication-title: Comput. Electr. Eng. doi: 10.1016/j.compeleceng.2012.06.016 – volume: 96 start-page: 59 year: 2014 ident: ref_63 article-title: Path Planning with Modified a Star Algorithm for a Mobile Robot publication-title: Procedia Eng. doi: 10.1016/j.proeng.2014.12.098 – volume: 70 start-page: 929 year: 2018 ident: ref_73 article-title: Online path planning for AUV rendezvous in dynamic cluttered undersea environment using evolutionary algorithms publication-title: Appl. Soft Comput. doi: 10.1016/j.asoc.2017.10.025 – volume: 19 start-page: 833 year: 2006 ident: ref_97 article-title: Robot path planning using particle swarm optimization of ferguson splines publication-title: IEEE Int. Conf. Emerg. Technol. Fact. Autom. ETFA – volume: 1 start-page: 269 year: 1959 ident: ref_52 article-title: A note on two problems in connexion with graphs publication-title: Numer. Math. doi: 10.1007/BF01386390 – volume: 6 start-page: 269 year: 2012 ident: ref_4 article-title: Trajectory Planning in Robotics publication-title: Math. Comput. Sci. doi: 10.1007/s11786-012-0123-8 – volume: 37 start-page: 157 year: 1988 ident: ref_7 article-title: A survey of motion planning and related geometric algorithms publication-title: Artif. Intell. doi: 10.1016/0004-3702(88)90053-7 – ident: ref_69 – volume: 7 start-page: 2138 year: 2019 ident: ref_106 article-title: Multi-Robot Path Planning Based on Multi-Objective Particle Swarm Optimization publication-title: IEEE Access doi: 10.1109/ACCESS.2018.2886245 – volume: 264 start-page: 830 year: 2018 ident: ref_1 article-title: Trends in transportation and logistics publication-title: Eur. J. Oper. Res. doi: 10.1016/j.ejor.2016.08.032 – volume: 10 start-page: 732 year: 2015 ident: ref_101 article-title: A Modified Membrane-Inspired Algorithm Based on Particle Swarm Optimization for Mobile Robot Path Planning publication-title: Int. J. Comput. Commun. Control. doi: 10.15837/ijccc.2015.5.2030 – volume: 24 start-page: 125 year: 2018 ident: ref_110 article-title: A study of fuzzy control with ant colony algorithm used in mobile robot for shortest path planning and obstacle avoidance publication-title: Microsyst. Technol. doi: 10.1007/s00542-016-3192-9 – volume: 30 start-page: 846 year: 2011 ident: ref_44 article-title: Sampling-based algorithms for optimal motion planning publication-title: Int. J. Robot. Res. doi: 10.1177/0278364911406761 – volume: 24 start-page: 219 year: 1992 ident: ref_8 article-title: Gross motion planning—A survey publication-title: ACM Comput. Surv. doi: 10.1145/136035.136037 – volume: 30 start-page: 319 year: 2015 ident: ref_51 article-title: Mobile robot path planning using artificial bee colony and evolutionary programming publication-title: Appl. Soft Comput. doi: 10.1016/j.asoc.2015.01.067 – volume: 2 start-page: 260 year: 2013 ident: ref_103 article-title: Optimal Path Planning For Intelligent Mobile Robot Navigation Using Modified Particle Swarm Optimization publication-title: Int. J. Eng. Adv. Technol. – volume: 128 start-page: 99 year: 2001 ident: ref_23 article-title: Robust Monte Carlo localization for mobile robots publication-title: Artif. Intell. doi: 10.1016/S0004-3702(01)00069-8 – volume: 127 start-page: 180 year: 2018 ident: ref_75 article-title: Genetic Algorithm Based Approach for Autonomous Mobile Robot Path Planning publication-title: Procedia Comput. Sci. doi: 10.1016/j.procs.2018.01.113 – volume: 25 start-page: 50 year: 2018 ident: ref_108 article-title: A path planning method using adaptive polymorphic ant colony algorithm for smart wheelchairs publication-title: J. Comput. Sci. doi: 10.1016/j.jocs.2018.02.004 – volume: 25 start-page: 627 year: 2006 ident: ref_43 article-title: On the probabilistic foundations of probabilistic roadmap planning publication-title: Int. J. Robot. Res. doi: 10.1177/0278364906067174 – ident: ref_70 doi: 10.1049/joe.2018.8266 – ident: ref_82 – ident: ref_105 doi: 10.1109/ICUAS.2013.6564702 – volume: 29 start-page: 101 year: 2007 ident: ref_10 article-title: Classic and Heuristic Approaches in Robot Motion Planning–A Chronological Review publication-title: World Acad. Sci. Eng. Technol. – ident: ref_37 – volume: 11 start-page: 143 year: 1994 ident: ref_72 article-title: Mobile manipulator path planning by a genetic algorithm publication-title: J. Robot. Syst. doi: 10.1002/rob.4620110302 – ident: ref_111 – ident: ref_21 – ident: ref_9 doi: 10.1109/SCORED.2006.4339335 – ident: ref_27 doi: 10.1109/ICRA.2011.5980555 – volume: 19 start-page: 301 year: 2005 ident: ref_40 article-title: Finding Narrow Passages with Probabilistic Roadmaps: The Small-Step Retraction Method publication-title: Auton. Robot. doi: 10.1007/s10514-005-4748-1 – volume: 25 start-page: 207 year: 2006 ident: ref_41 article-title: Planning Tours of Robotic Arms among Partitioned Goals publication-title: Int. J. Robot. Res. doi: 10.1177/0278364906061705 – ident: ref_116 – volume: 32 start-page: 108 year: 1983 ident: ref_25 article-title: Spatial Planning: A Configuration Space Approach publication-title: IEEE Trans. Comput. – ident: ref_99 doi: 10.1109/ICMA.2006.257474 – volume: 1 start-page: 24 year: 2013 ident: ref_18 article-title: Controlling the Motion of an Autonomous Mobile Robot Using Various Techniques: A Review publication-title: J. Adv. Mech. Eng. – volume: 23 start-page: 617 year: 2019 ident: ref_113 article-title: ACO-A*: Ant Colony Optimization Plus A* for 3-D Traveling in Environments With Dense Obstacles publication-title: IEEE Trans. Evol. Comput. doi: 10.1109/TEVC.2018.2878221 – ident: ref_5 doi: 10.1109/SFCS.1988.21947 – ident: ref_45 doi: 10.1007/978-3-319-29363-9_24 – volume: 12 start-page: 566 year: 1996 ident: ref_29 article-title: Probabilistic roadmaps for path planning in high-dimensional configuration spaces publication-title: IEEE Trans. Robot. Autom. doi: 10.1109/70.508439 – volume: 22 start-page: 318 year: 1992 ident: ref_20 article-title: Path planning for a mobile robot publication-title: IEEE Trans. Syst. Man Cybern. doi: 10.1109/21.148404 – volume: 115 start-page: 106 year: 2019 ident: ref_79 article-title: Multi-objective multi-robot path planning in continuous environment using an enhanced genetic algorithm publication-title: Expert Syst. Appl. doi: 10.1016/j.eswa.2018.08.008 – volume: 12 start-page: 1231 year: 2012 ident: ref_62 article-title: Fuzzy Dijkstra algorithm for shortest path problem under uncertain environment publication-title: Appl. Soft Comput. doi: 10.1016/j.asoc.2011.11.011 – ident: ref_60 – volume: 36 start-page: 345 year: 1983 ident: ref_3 article-title: On the “piano movers” problem I. The case of a two-dimensional rigid polygonal body moving amidst polygonal barriers publication-title: Commun. Pure Appl. Math. doi: 10.1002/cpa.3160360305 – volume: 68 start-page: 141 year: 2019 ident: ref_121 article-title: Path Planning for Autonomous Underwater Vehicles: An Ant Colony Algorithm Incorporating Alarm Pheromone publication-title: IEEE Trans. Veh. Technol. doi: 10.1109/TVT.2018.2882130 – ident: ref_57 – volume: 103 start-page: 172 year: 2013 ident: ref_94 article-title: Robot path planning in uncertain environment using multi-objective particle swarm optimization publication-title: Neurocomputing doi: 10.1016/j.neucom.2012.09.019 |
| SSID | ssj0000913830 |
| Score | 2.2789204 |
| Snippet | Path planning for mobile agents is one of the areas that has drawn the attention of researchers’, as evidenced in the large number of papers related to the... |
| SourceID | crossref |
| SourceType | Enrichment Source Index Database |
| StartPage | 316 |
| Title | A Performance Review of Collision-Free Path Planning Algorithms |
| Volume | 9 |
| WOSCitedRecordID | wos000518412200116&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| journalDatabaseRights | – providerCode: PRVHPJ databaseName: ROAD: Directory of Open Access Scholarly Resources customDbUrl: eissn: 2079-9292 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0000913830 issn: 2079-9292 databaseCode: M~E dateStart: 20120101 isFulltext: true titleUrlDefault: https://road.issn.org providerName: ISSN International Centre – providerCode: PRVPQU databaseName: ProQuest advanced technologies & aerospace journals customDbUrl: eissn: 2079-9292 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0000913830 issn: 2079-9292 databaseCode: P5Z dateStart: 20120301 isFulltext: true titleUrlDefault: https://search.proquest.com/hightechjournals providerName: ProQuest – providerCode: PRVPQU databaseName: ProQuest Central customDbUrl: eissn: 2079-9292 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0000913830 issn: 2079-9292 databaseCode: BENPR dateStart: 20120301 isFulltext: true titleUrlDefault: https://www.proquest.com/central providerName: ProQuest – providerCode: PRVPQU databaseName: ProQuest Publicly Available Content Database customDbUrl: eissn: 2079-9292 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0000913830 issn: 2079-9292 databaseCode: PIMPY dateStart: 20120301 isFulltext: true titleUrlDefault: http://search.proquest.com/publiccontent providerName: ProQuest |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwtV1LTxsxELZ49AAHVGgRaWnlQ2-RRbxrx-tTFRCISyMEVMot8muboGgT5YHopb-9492NYwitmkMv1sryjuT9vLMzszPzIfTFiEwzm2TECGsJU1oTxZUh1ErJlG1ZLnRJNiG63azXkzc1f-espBMQRZE9PcnJf4Ua5gBsXzq7AdxBKEzANYAOI8AO4z8B3_FZ7aEY4DaUpvgQQVlITq6mzvne_INAWdTsjH6Mp8P5oO5dvgzVB46cMjZ7Dl-8URQ6uBtUDQiufy586k6UKVAF5hfFg3JxWAF8yFZI0Si1T9ISkoDtVKlK98pcrT5ldEqSSBWmVQ3lSxWdptLnNK5IfmbS_wylr_TDfvGdCtmD4Ld4Kf11GdtoNxFceu327dcq1uZ7n2Yl7UzYQVU_5cWcrYuJbJTI2Lh_iw5qLwF3KnQP0ZYrjtB-1DvyHfrawRHOuMIZj3P8HGfsccZLnPEK5_fo-9Xl_cU1qdkwiEkknROacmO1ZtzxtG1y7ihVlnMBJr2xuVRUsRxeL6Ylyyx4Id68s8xmORj47bbI02O0U4wLd4JwqmGjOlGJkpxR8AHaOmc0Z6alYTk1DUSX---bulW8ZywZ9f_86BuoGe6ZVI1S_rL6w0arP6K91RE9RTvz6cJ9Qm_M43w4m34usf4NhoVlLA |
| linkProvider | ISSN International Centre |
| openUrl | ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=A+Performance+Review+of+Collision-Free+Path+Planning+Algorithms&rft.jtitle=Electronics+%28Basel%29&rft.au=Shin%2C+Hyunwoo&rft.au=Chae%2C+Junjae&rft.date=2020-02-01&rft.issn=2079-9292&rft.eissn=2079-9292&rft.volume=9&rft.issue=2&rft.spage=316&rft_id=info:doi/10.3390%2Felectronics9020316&rft.externalDBID=n%2Fa&rft.externalDocID=10_3390_electronics9020316 |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=2079-9292&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=2079-9292&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=2079-9292&client=summon |