{"id":"https://openalex.org/W2981090122","doi":"https://doi.org/10.1109/ecmr.2019.8870971","title":"Robot Path Planning for Multiple Target Regions","display_name":"Robot Path Planning for Multiple Target Regions","publication_year":2019,"publication_date":"2019-09-01","ids":{"openalex":"https://openalex.org/W2981090122","doi":"https://doi.org/10.1109/ecmr.2019.8870971","mag":"2981090122"},"language":"en","primary_location":{"id":"doi:10.1109/ecmr.2019.8870971","is_oa":false,"landing_page_url":"https://doi.org/10.1109/ecmr.2019.8870971","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2019 European Conference on Mobile Robots (ECMR)","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/A5080887568","display_name":"Shu Ishida","orcid":null},"institutions":[{"id":"https://openalex.org/I40120149","display_name":"University of Oxford","ror":"https://ror.org/052gg0110","country_code":"GB","type":"education","lineage":["https://openalex.org/I40120149"]}],"countries":["GB"],"is_corresponding":true,"raw_author_name":"Shu Ishida","raw_affiliation_strings":["Department of Engineering Science, University of Oxford"],"affiliations":[{"raw_affiliation_string":"Department of Engineering Science, University of Oxford","institution_ids":["https://openalex.org/I40120149"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5055581161","display_name":"Marc Rigter","orcid":"https://orcid.org/0000-0002-5219-8552"},"institutions":[{"id":"https://openalex.org/I40120149","display_name":"University of Oxford","ror":"https://ror.org/052gg0110","country_code":"GB","type":"education","lineage":["https://openalex.org/I40120149"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Marc Rigter","raw_affiliation_strings":["Department of Engineering Science, University of Oxford"],"affiliations":[{"raw_affiliation_string":"Department of Engineering Science, University of Oxford","institution_ids":["https://openalex.org/I40120149"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5059686746","display_name":"Nick Hawes","orcid":"https://orcid.org/0000-0002-7556-6098"},"institutions":[{"id":"https://openalex.org/I40120149","display_name":"University of Oxford","ror":"https://ror.org/052gg0110","country_code":"GB","type":"education","lineage":["https://openalex.org/I40120149"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Nick Hawes","raw_affiliation_strings":["Department of Engineering Science, University of Oxford"],"affiliations":[{"raw_affiliation_string":"Department of Engineering Science, University of Oxford","institution_ids":["https://openalex.org/I40120149"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5080887568"],"corresponding_institution_ids":["https://openalex.org/I40120149"],"apc_list":null,"apc_paid":null,"fwci":0.4049,"has_fulltext":false,"cited_by_count":4,"citation_normalized_percentile":{"value":0.65876527,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"6"},"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/T10191","display_name":"Robotics and Sensor-Based Localization","score":0.9973000288009644,"subfield":{"id":"https://openalex.org/subfields/2202","display_name":"Aerospace 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.991599977016449,"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/motion-planning","display_name":"Motion planning","score":0.7200488448143005},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6542825698852539},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.6043980121612549},{"id":"https://openalex.org/keywords/robot","display_name":"Robot","score":0.5707528591156006},{"id":"https://openalex.org/keywords/mobile-robot","display_name":"Mobile robot","score":0.4635407626628876},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.437118262052536},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.11667266488075256}],"concepts":[{"id":"https://openalex.org/C81074085","wikidata":"https://www.wikidata.org/wiki/Q366872","display_name":"Motion planning","level":3,"score":0.7200488448143005},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6542825698852539},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.6043980121612549},{"id":"https://openalex.org/C90509273","wikidata":"https://www.wikidata.org/wiki/Q11012","display_name":"Robot","level":2,"score":0.5707528591156006},{"id":"https://openalex.org/C19966478","wikidata":"https://www.wikidata.org/wiki/Q4810574","display_name":"Mobile robot","level":3,"score":0.4635407626628876},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.437118262052536},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.11667266488075256}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/ecmr.2019.8870971","is_oa":false,"landing_page_url":"https://doi.org/10.1109/ecmr.2019.8870971","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2019 European Conference on Mobile Robots (ECMR)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Sustainable cities and communities","score":0.46000000834465027,"id":"https://metadata.un.org/sdg/11"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":28,"referenced_works":["https://openalex.org/W131069610","https://openalex.org/W178935948","https://openalex.org/W1969483458","https://openalex.org/W1971086298","https://openalex.org/W2020256696","https://openalex.org/W2028875546","https://openalex.org/W2043003284","https://openalex.org/W2046419297","https://openalex.org/W2047747795","https://openalex.org/W2057025928","https://openalex.org/W2096636360","https://openalex.org/W2113207783","https://openalex.org/W2125334953","https://openalex.org/W2128990851","https://openalex.org/W2163178194","https://openalex.org/W2169528473","https://openalex.org/W2296248084","https://openalex.org/W2323709497","https://openalex.org/W2341150500","https://openalex.org/W2394868534","https://openalex.org/W2578270790","https://openalex.org/W2951796861","https://openalex.org/W3101693694","https://openalex.org/W4213368447","https://openalex.org/W6605295560","https://openalex.org/W6607209020","https://openalex.org/W6701078926","https://openalex.org/W6712082491"],"related_works":["https://openalex.org/W2122871747","https://openalex.org/W1904098742","https://openalex.org/W3158921809","https://openalex.org/W1980828932","https://openalex.org/W2161428574","https://openalex.org/W3114279067","https://openalex.org/W1972453571","https://openalex.org/W2077416514","https://openalex.org/W2618632915","https://openalex.org/W2359600231"],"abstract_inverted_index":{"Optimal":[0],"path":[1,54],"planning":[2,41,136],"to":[3,21,62,79,92,102,119,182,185],"point":[4,32],"goals":[5],"is":[6,18,77],"a":[7,26,48,117,139,142,165,170],"well-researched":[8],"problem.":[9],"However,":[10],"in":[11,47,180],"the":[12,63,84,88,94,104,127,130,160,176],"context":[13],"of":[14,28,113,129,141],"mobile":[15],"robotics,":[16],"it":[17],"often":[19],"desirable":[20],"generate":[22],"plans":[23,109],"which":[24,43,108],"visit":[25,44],"sequence":[27],"regions,":[29],"rather":[30],"than":[31],"goals.":[33],"In":[34],"this":[35,100],"paper,":[36],"we":[37,98],"investigate":[38],"methods":[39,132,137],"for":[40,70],"paths":[42,82],"multiple":[45,72],"regions":[46],"specified":[49],"order,":[50],"whilst":[51],"minimising":[52],"total":[53,177],"cost.":[55],"We":[56,125],"propose":[57],"Multi-Region":[58,106,150,162],"A*,":[59],"an":[60,67,156],"extension":[61],"A*":[64,107,135,151,163],"algorithm":[65],"with":[66,152,164],"admissible":[68],"heuristic":[69,76],"traversing":[71],"target":[73],"regions.":[74,114],"The":[75,146],"used":[78],"trim":[80],"sub-optimal":[81],"from":[83],"search,":[85],"thereby":[86],"reducing":[87],"computation":[89,123],"time":[90],"required":[91],"find":[93],"optimal":[95,157],"solution.":[96],"Additionally,":[97],"extend":[99],"method":[101],"create":[103],"Windowed":[105,161],"through":[110],"overlapping":[111],"sequences":[112],"This":[115],"provides":[116],"mechanism":[118],"trade-off":[120],"optimality":[121],"against":[122,133],"time.":[124],"evaluate":[126],"performance":[128],"proposed":[131],"point-to-point":[134],"using":[138],"simulation":[140],"wheeled":[143],"office":[144],"robot.":[145],"evaluation":[147],"shows":[148],"that":[149],"search":[153],"pruning":[154],"produces":[155],"path,":[158],"and":[159],"small":[166],"window":[167],"size":[168],"gives":[169],"good":[171],"approximate":[172],"solution":[173],"without":[174],"compromising":[175],"navigation":[178],"time,":[179],"addition":[181],"providing":[183],"robustness":[184],"dynamic":[186],"obstacles.":[187]},"counts_by_year":[{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":3}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}