{"id":"https://openalex.org/W2016254033","doi":"https://doi.org/10.1109/aim.2013.6584061","title":"Hybrid Dijkstra-PSO algorithm for motion planning of non-holonomic multiple-trailer platforms in dense contexts","display_name":"Hybrid Dijkstra-PSO algorithm for motion planning of non-holonomic multiple-trailer platforms in dense contexts","publication_year":2013,"publication_date":"2013-07-01","ids":{"openalex":"https://openalex.org/W2016254033","doi":"https://doi.org/10.1109/aim.2013.6584061","mag":"2016254033"},"language":"en","primary_location":{"id":"doi:10.1109/aim.2013.6584061","is_oa":false,"landing_page_url":"https://doi.org/10.1109/aim.2013.6584061","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2013 IEEE/ASME International Conference on Advanced Intelligent Mechatronics","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5018836771","display_name":"Karime Pereida","orcid":"https://orcid.org/0000-0002-8576-2164"},"institutions":[{"id":"https://openalex.org/I31746571","display_name":"UNSW Sydney","ror":"https://ror.org/03r8z3t63","country_code":"AU","type":"education","lineage":["https://openalex.org/I31746571"]}],"countries":["AU"],"is_corresponding":true,"raw_author_name":"Karime Pereida","raw_affiliation_strings":["School of Mechanical and Manufacturing Engineering, University of New South Wales, Australia","Sch. of Mech. & Manuf. Eng., Univ. of New South Wales, Sydney, NSW, Australia"],"affiliations":[{"raw_affiliation_string":"School of Mechanical and Manufacturing Engineering, University of New South Wales, Australia","institution_ids":["https://openalex.org/I31746571"]},{"raw_affiliation_string":"Sch. of Mech. & Manuf. Eng., Univ. of New South Wales, Sydney, NSW, Australia","institution_ids":["https://openalex.org/I31746571"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5015957710","display_name":"Jos\u00e9 Guivant","orcid":"https://orcid.org/0000-0002-8556-8652"},"institutions":[{"id":"https://openalex.org/I31746571","display_name":"UNSW Sydney","ror":"https://ror.org/03r8z3t63","country_code":"AU","type":"education","lineage":["https://openalex.org/I31746571"]}],"countries":["AU"],"is_corresponding":false,"raw_author_name":"Jose Guivant","raw_affiliation_strings":["School of Mechanical and Manufacturing Engineering, University of New South Wales, Australia","Sch. of Mech. & Manuf. Eng., Univ. of New South Wales, Sydney, NSW, Australia"],"affiliations":[{"raw_affiliation_string":"School of Mechanical and Manufacturing Engineering, University of New South Wales, Australia","institution_ids":["https://openalex.org/I31746571"]},{"raw_affiliation_string":"Sch. of Mech. & Manuf. Eng., Univ. of New South Wales, Sydney, NSW, Australia","institution_ids":["https://openalex.org/I31746571"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5018836771"],"corresponding_institution_ids":["https://openalex.org/I31746571"],"apc_list":null,"apc_paid":null,"fwci":1.3608,"has_fulltext":false,"cited_by_count":10,"citation_normalized_percentile":{"value":0.83307489,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"13","last_page":"18"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11615","display_name":"Control and Dynamics of Mobile Robots","score":0.9976000189781189,"subfield":{"id":"https://openalex.org/subfields/2207","display_name":"Control and Systems Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11814","display_name":"Advanced Manufacturing and Logistics Optimization","score":0.9721999764442444,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/motion-planning","display_name":"Motion planning","score":0.8034929037094116},{"id":"https://openalex.org/keywords/dijkstras-algorithm","display_name":"Dijkstra's algorithm","score":0.7830623984336853},{"id":"https://openalex.org/keywords/holonomic","display_name":"Holonomic","score":0.7160654664039612},{"id":"https://openalex.org/keywords/trailer","display_name":"Trailer","score":0.6238465309143066},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6062091588973999},{"id":"https://openalex.org/keywords/mobile-robot","display_name":"Mobile robot","score":0.5054686069488525},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5041178464889526},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.48255079984664917},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4654885530471802},{"id":"https://openalex.org/keywords/suurballes-algorithm","display_name":"Suurballe's algorithm","score":0.4422447979450226},{"id":"https://openalex.org/keywords/minimisation","display_name":"Minimisation (clinical trials)","score":0.41646912693977356},{"id":"https://openalex.org/keywords/robot","display_name":"Robot","score":0.39638781547546387},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.26073509454727173},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.2595449388027191},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.24324512481689453},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.12234598398208618}],"concepts":[{"id":"https://openalex.org/C81074085","wikidata":"https://www.wikidata.org/wiki/Q366872","display_name":"Motion planning","level":3,"score":0.8034929037094116},{"id":"https://openalex.org/C173870130","wikidata":"https://www.wikidata.org/wiki/Q8548","display_name":"Dijkstra's algorithm","level":4,"score":0.7830623984336853},{"id":"https://openalex.org/C2777964439","wikidata":"https://www.wikidata.org/wiki/Q5884201","display_name":"Holonomic","level":2,"score":0.7160654664039612},{"id":"https://openalex.org/C2779101595","wikidata":"https://www.wikidata.org/wiki/Q7832787","display_name":"Trailer","level":2,"score":0.6238465309143066},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6062091588973999},{"id":"https://openalex.org/C19966478","wikidata":"https://www.wikidata.org/wiki/Q4810574","display_name":"Mobile robot","level":3,"score":0.5054686069488525},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5041178464889526},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.48255079984664917},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4654885530471802},{"id":"https://openalex.org/C98779529","wikidata":"https://www.wikidata.org/wiki/Q7650417","display_name":"Suurballe's algorithm","level":5,"score":0.4422447979450226},{"id":"https://openalex.org/C86941820","wikidata":"https://www.wikidata.org/wiki/Q6865391","display_name":"Minimisation (clinical trials)","level":2,"score":0.41646912693977356},{"id":"https://openalex.org/C90509273","wikidata":"https://www.wikidata.org/wiki/Q11012","display_name":"Robot","level":2,"score":0.39638781547546387},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.26073509454727173},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.2595449388027191},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.24324512481689453},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.12234598398208618},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.0},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/aim.2013.6584061","is_oa":false,"landing_page_url":"https://doi.org/10.1109/aim.2013.6584061","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2013 IEEE/ASME International Conference on Advanced Intelligent Mechatronics","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.6600000262260437,"id":"https://metadata.un.org/sdg/11","display_name":"Sustainable cities and communities"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":9,"referenced_works":["https://openalex.org/W2059681931","https://openalex.org/W2111231856","https://openalex.org/W2136349505","https://openalex.org/W2152195021","https://openalex.org/W2168463767","https://openalex.org/W2169834317","https://openalex.org/W2171574770","https://openalex.org/W2182358506","https://openalex.org/W6686245384"],"related_works":["https://openalex.org/W2314157120","https://openalex.org/W2382831994","https://openalex.org/W1817053572","https://openalex.org/W2371042914","https://openalex.org/W2376231728","https://openalex.org/W3015233512","https://openalex.org/W2339073167","https://openalex.org/W2978166001","https://openalex.org/W2136320479","https://openalex.org/W3023359981"],"abstract_inverted_index":{"This":[0],"work":[1],"proposes":[2],"and":[3,31,82],"illustrates":[4],"an":[5],"efficient":[6],"path":[7],"planning":[8],"algorithm":[9,39,95],"for":[10],"non-holonomic":[11],"multiple-trailer":[12],"platforms.":[13],"The":[14,37,67],"goal":[15],"is":[16],"to":[17,22,59,64,71,74],"find":[18,60],"optimal":[19,61],"paths":[20,62],"according":[21,63],"different":[23],"criteria":[24],"using":[25],"dense":[26],"properties":[27],"of":[28,78,84,93],"a":[29,41],"map":[30],"considering":[32],"the":[33,52,79,85,91,94],"robot's":[34],"dynamic":[35],"constraints.":[36,66],"proposed":[38],"combines":[40],"low":[42],"dimensional":[43,54],"Dijkstra":[44],"cost-to-go":[45],"function":[46],"with":[47],"PSO":[48],"minimisation,":[49],"performed":[50],"in":[51,57],"higher":[53,76],"configuration":[55],"space,":[56],"order":[58],"diverse":[65],"methodology":[68],"includes":[69],"adaptations":[70],"both":[72],"algorithms":[73],"achieve":[75],"efficiency":[77],"computational":[80],"cost":[81],"optimality":[83],"planned":[86],"path.":[87],"Experimental":[88],"results":[89],"show":[90],"performance":[92],"under":[96],"several":[97],"circumstances.":[98]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":2},{"year":2015,"cited_by_count":2},{"year":2014,"cited_by_count":2},{"year":2013,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}