{"id":"https://openalex.org/W1965250166","doi":"https://doi.org/10.1109/iecon.2012.6389140","title":"Optimal path planning for an autonomous robot-trailer system","display_name":"Optimal path planning for an autonomous robot-trailer system","publication_year":2012,"publication_date":"2012-10-01","ids":{"openalex":"https://openalex.org/W1965250166","doi":"https://doi.org/10.1109/iecon.2012.6389140","mag":"1965250166"},"language":"en","primary_location":{"id":"doi:10.1109/iecon.2012.6389140","is_oa":false,"landing_page_url":"https://doi.org/10.1109/iecon.2012.6389140","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IECON 2012 - 38th Annual Conference on IEEE Industrial Electronics Society","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/A5106403699","display_name":"Xin Yu","orcid":"https://orcid.org/0009-0009-2896-1640"},"institutions":[{"id":"https://openalex.org/I82497590","display_name":"Auburn University","ror":"https://ror.org/02v80fc35","country_code":"US","type":"education","lineage":["https://openalex.org/I82497590"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Xin Yu","raw_affiliation_strings":["Electrical and Computer Engineering, Auburn University, AL, USA"],"affiliations":[{"raw_affiliation_string":"Electrical and Computer Engineering, Auburn University, AL, USA","institution_ids":["https://openalex.org/I82497590"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5102707459","display_name":"John Y. Hung","orcid":"https://orcid.org/0000-0002-1444-1419"},"institutions":[{"id":"https://openalex.org/I82497590","display_name":"Auburn University","ror":"https://ror.org/02v80fc35","country_code":"US","type":"education","lineage":["https://openalex.org/I82497590"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"John Y. Hung","raw_affiliation_strings":["Electrical and Computer Engineering, Auburn University, AL, USA"],"affiliations":[{"raw_affiliation_string":"Electrical and Computer Engineering, Auburn University, AL, USA","institution_ids":["https://openalex.org/I82497590"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5106403699"],"corresponding_institution_ids":["https://openalex.org/I82497590"],"apc_list":null,"apc_paid":null,"fwci":1.1067,"has_fulltext":false,"cited_by_count":12,"citation_normalized_percentile":{"value":0.78328917,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"2762","last_page":"2767"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":1.0,"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":1.0,"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/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9932000041007996,"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"}},{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9905999898910522,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/travelling-salesman-problem","display_name":"Travelling salesman problem","score":0.8144279718399048},{"id":"https://openalex.org/keywords/trailer","display_name":"Trailer","score":0.788114070892334},{"id":"https://openalex.org/keywords/waypoint","display_name":"Waypoint","score":0.7599618434906006},{"id":"https://openalex.org/keywords/motion-planning","display_name":"Motion planning","score":0.7510395050048828},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5612126588821411},{"id":"https://openalex.org/keywords/robot","display_name":"Robot","score":0.5567992329597473},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.5274137258529663},{"id":"https://openalex.org/keywords/mobile-robot","display_name":"Mobile robot","score":0.48988574743270874},{"id":"https://openalex.org/keywords/dimension","display_name":"Dimension (graph theory)","score":0.47285938262939453},{"id":"https://openalex.org/keywords/disjoint-sets","display_name":"Disjoint sets","score":0.46439698338508606},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.4087650775909424},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.24343127012252808},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.23767492175102234},{"id":"https://openalex.org/keywords/real-time-computing","display_name":"Real-time computing","score":0.2324443757534027},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.23012080788612366},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.10638466477394104}],"concepts":[{"id":"https://openalex.org/C175859090","wikidata":"https://www.wikidata.org/wiki/Q322212","display_name":"Travelling salesman problem","level":2,"score":0.8144279718399048},{"id":"https://openalex.org/C2779101595","wikidata":"https://www.wikidata.org/wiki/Q7832787","display_name":"Trailer","level":2,"score":0.788114070892334},{"id":"https://openalex.org/C2781271823","wikidata":"https://www.wikidata.org/wiki/Q138081","display_name":"Waypoint","level":2,"score":0.7599618434906006},{"id":"https://openalex.org/C81074085","wikidata":"https://www.wikidata.org/wiki/Q366872","display_name":"Motion planning","level":3,"score":0.7510395050048828},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5612126588821411},{"id":"https://openalex.org/C90509273","wikidata":"https://www.wikidata.org/wiki/Q11012","display_name":"Robot","level":2,"score":0.5567992329597473},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5274137258529663},{"id":"https://openalex.org/C19966478","wikidata":"https://www.wikidata.org/wiki/Q4810574","display_name":"Mobile robot","level":3,"score":0.48988574743270874},{"id":"https://openalex.org/C33676613","wikidata":"https://www.wikidata.org/wiki/Q13415176","display_name":"Dimension (graph theory)","level":2,"score":0.47285938262939453},{"id":"https://openalex.org/C45340560","wikidata":"https://www.wikidata.org/wiki/Q215382","display_name":"Disjoint sets","level":2,"score":0.46439698338508606},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4087650775909424},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.24343127012252808},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.23767492175102234},{"id":"https://openalex.org/C79403827","wikidata":"https://www.wikidata.org/wiki/Q3988","display_name":"Real-time computing","level":1,"score":0.2324443757534027},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.23012080788612366},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.10638466477394104},{"id":"https://openalex.org/C202444582","wikidata":"https://www.wikidata.org/wiki/Q837863","display_name":"Pure mathematics","level":1,"score":0.0},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/iecon.2012.6389140","is_oa":false,"landing_page_url":"https://doi.org/10.1109/iecon.2012.6389140","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IECON 2012 - 38th Annual Conference on IEEE Industrial Electronics Society","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/11","display_name":"Sustainable cities and communities","score":0.8299999833106995}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":28,"referenced_works":["https://openalex.org/W1492170047","https://openalex.org/W1646289414","https://openalex.org/W1970071808","https://openalex.org/W1992370839","https://openalex.org/W2017708378","https://openalex.org/W2047747795","https://openalex.org/W2047800349","https://openalex.org/W2054575839","https://openalex.org/W2104642742","https://openalex.org/W2110824994","https://openalex.org/W2117257995","https://openalex.org/W2131569937","https://openalex.org/W2132365951","https://openalex.org/W2134638269","https://openalex.org/W2137812761","https://openalex.org/W2137880701","https://openalex.org/W2145128369","https://openalex.org/W2160222800","https://openalex.org/W2168990813","https://openalex.org/W2313274380","https://openalex.org/W2323709497","https://openalex.org/W2332499306","https://openalex.org/W3121675905","https://openalex.org/W3150899403","https://openalex.org/W6629227631","https://openalex.org/W6663968304","https://openalex.org/W6675822643","https://openalex.org/W6679479287"],"related_works":["https://openalex.org/W2688471429","https://openalex.org/W4360939124","https://openalex.org/W2077345734","https://openalex.org/W2899287767","https://openalex.org/W2275928629","https://openalex.org/W4387126713","https://openalex.org/W2612848489","https://openalex.org/W2915444871","https://openalex.org/W2096610529","https://openalex.org/W2863424594"],"abstract_inverted_index":{"In":[0],"this":[1,102],"paper":[2],"the":[3,21,25,55,59,63,79,93,106,110,117],"authors":[4,86],"discuss":[5],"a":[6,37,41,49,70,89],"path":[7,108],"planning":[8],"problem":[9,66],"for":[10,20,92,109,124],"an":[11],"autonomous":[12],"robot-trailer":[13],"system,":[14],"while":[15],"also":[16],"including":[17],"some":[18],"consideration":[19],"physical":[22,56],"dimension":[23],"of":[24,43,48,58],"trailer.":[26,64],"The":[27,46,65,85,112],"trailer":[28],"equipped":[29],"with":[30,75,97],"sensing":[31],"equipments":[32],"is":[33,51,67],"used":[34,52],"to":[35,53,104],"perform":[36,121],"surveillance":[38],"mission":[39],"among":[40],"collection":[42],"waypoint":[44],"neighborhoods.":[45],"concept":[47],"neighborhood":[50],"model":[54],"size":[57],"actual":[60],"sensors":[61],"on":[62],"modeled":[68],"as":[69],"Dubins":[71],"Traveling":[72,94],"Salesman":[73,95],"Problem":[74,96],"Neighborhoods":[76,98],"(DTSPN),":[77],"where":[78],"neighborhoods":[80],"are":[81],"represented":[82],"by":[83],"disks.":[84],"firstly":[87],"design":[88],"new":[90],"algorithm":[91,103,119],"(TSPN),":[99],"then":[100],"extend":[101],"find":[105],"shortest":[107],"DTSPN.":[111],"numerical":[113],"study":[114],"shows":[115],"that":[116],"proposed":[118],"can":[120],"very":[122],"well":[123],"both":[125],"disjoint":[126],"and":[127],"overlapped":[128],"disks":[129],"cases.":[130]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":2},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":4}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}