{"id":"https://openalex.org/W2171157557","doi":"https://doi.org/10.1109/cdc.2008.4738911","title":"Efficient dynamic programming for optimal multi-location robot rendezvous","display_name":"Efficient dynamic programming for optimal multi-location robot rendezvous","publication_year":2008,"publication_date":"2008-01-01","ids":{"openalex":"https://openalex.org/W2171157557","doi":"https://doi.org/10.1109/cdc.2008.4738911","mag":"2171157557"},"language":"en","primary_location":{"id":"doi:10.1109/cdc.2008.4738911","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cdc.2008.4738911","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2008 47th IEEE Conference on Decision and Control","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/A5111934623","display_name":"Ken Alton","orcid":null},"institutions":[{"id":"https://openalex.org/I141945490","display_name":"University of British Columbia","ror":"https://ror.org/03rmrcq20","country_code":"CA","type":"education","lineage":["https://openalex.org/I141945490"]}],"countries":["CA"],"is_corresponding":true,"raw_author_name":"Ken Alton","raw_affiliation_strings":["Department of Computer Science, University of British Columbia, Vancouver, BC, Canada"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of British Columbia, Vancouver, BC, Canada","institution_ids":["https://openalex.org/I141945490"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5086488324","display_name":"Ian M. Mitchell","orcid":"https://orcid.org/0000-0001-7053-441X"},"institutions":[{"id":"https://openalex.org/I141945490","display_name":"University of British Columbia","ror":"https://ror.org/03rmrcq20","country_code":"CA","type":"education","lineage":["https://openalex.org/I141945490"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"Ian M. Mitchell","raw_affiliation_strings":["Department of Computer Science, University of British Columbia, Vancouver, BC, Canada"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of British Columbia, Vancouver, BC, Canada","institution_ids":["https://openalex.org/I141945490"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5111934623"],"corresponding_institution_ids":["https://openalex.org/I141945490"],"apc_list":null,"apc_paid":null,"fwci":0.7024,"has_fulltext":false,"cited_by_count":6,"citation_normalized_percentile":{"value":0.7646278,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":"6","issue":null,"first_page":"2794","last_page":"2799"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9998000264167786,"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.9998000264167786,"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/T12288","display_name":"Optimization and Search Problems","score":0.9998000264167786,"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"}},{"id":"https://openalex.org/T10249","display_name":"Distributed Control Multi-Agent Systems","score":0.9984999895095825,"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/rendezvous","display_name":"Rendezvous","score":0.9369969367980957},{"id":"https://openalex.org/keywords/correctness","display_name":"Correctness","score":0.8483592867851257},{"id":"https://openalex.org/keywords/dynamic-programming","display_name":"Dynamic programming","score":0.7389709949493408},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.695813000202179},{"id":"https://openalex.org/keywords/robot","display_name":"Robot","score":0.6773045659065247},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.6003082394599915},{"id":"https://openalex.org/keywords/node","display_name":"Node (physics)","score":0.560529887676239},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.4731501340866089},{"id":"https://openalex.org/keywords/robot-kinematics","display_name":"Robot kinematics","score":0.4170389175415039},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.30687910318374634},{"id":"https://openalex.org/keywords/mobile-robot","display_name":"Mobile robot","score":0.28269079327583313},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.2500435709953308},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.16221576929092407},{"id":"https://openalex.org/keywords/engineering","display_name":"Engineering","score":0.11147835850715637}],"concepts":[{"id":"https://openalex.org/C2779968344","wikidata":"https://www.wikidata.org/wiki/Q3932925","display_name":"Rendezvous","level":3,"score":0.9369969367980957},{"id":"https://openalex.org/C55439883","wikidata":"https://www.wikidata.org/wiki/Q360812","display_name":"Correctness","level":2,"score":0.8483592867851257},{"id":"https://openalex.org/C37404715","wikidata":"https://www.wikidata.org/wiki/Q380679","display_name":"Dynamic programming","level":2,"score":0.7389709949493408},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.695813000202179},{"id":"https://openalex.org/C90509273","wikidata":"https://www.wikidata.org/wiki/Q11012","display_name":"Robot","level":2,"score":0.6773045659065247},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.6003082394599915},{"id":"https://openalex.org/C62611344","wikidata":"https://www.wikidata.org/wiki/Q1062658","display_name":"Node (physics)","level":2,"score":0.560529887676239},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4731501340866089},{"id":"https://openalex.org/C74222875","wikidata":"https://www.wikidata.org/wiki/Q16000312","display_name":"Robot kinematics","level":4,"score":0.4170389175415039},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.30687910318374634},{"id":"https://openalex.org/C19966478","wikidata":"https://www.wikidata.org/wiki/Q4810574","display_name":"Mobile robot","level":3,"score":0.28269079327583313},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.2500435709953308},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.16221576929092407},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.11147835850715637},{"id":"https://openalex.org/C66938386","wikidata":"https://www.wikidata.org/wiki/Q633538","display_name":"Structural engineering","level":1,"score":0.0},{"id":"https://openalex.org/C29829512","wikidata":"https://www.wikidata.org/wiki/Q40218","display_name":"Spacecraft","level":2,"score":0.0},{"id":"https://openalex.org/C146978453","wikidata":"https://www.wikidata.org/wiki/Q3798668","display_name":"Aerospace engineering","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/cdc.2008.4738911","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cdc.2008.4738911","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2008 47th IEEE Conference on Decision and Control","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":16,"referenced_works":["https://openalex.org/W1424654272","https://openalex.org/W1487586009","https://openalex.org/W1502120986","https://openalex.org/W1521785144","https://openalex.org/W1999244633","https://openalex.org/W2002182424","https://openalex.org/W2025550225","https://openalex.org/W2028274662","https://openalex.org/W2055341194","https://openalex.org/W2098432798","https://openalex.org/W2106599774","https://openalex.org/W2116029719","https://openalex.org/W2126757501","https://openalex.org/W2169528473","https://openalex.org/W2611243847","https://openalex.org/W6630293511"],"related_works":["https://openalex.org/W2057371520","https://openalex.org/W2542862126","https://openalex.org/W2807763113","https://openalex.org/W2030068303","https://openalex.org/W1521763702","https://openalex.org/W2245527669","https://openalex.org/W937816491","https://openalex.org/W2046042302","https://openalex.org/W2906790212","https://openalex.org/W3205491096"],"abstract_inverted_index":{"We":[0],"present":[1],"an":[2,63],"efficient":[3],"dynamic":[4,52],"programming":[5,53],"algorithm":[6,36,89],"to":[7,54],"solve":[8],"the":[9,35,61,67,88,100],"problem":[10,18,98],"of":[11,32,69,87],"optimal":[12,38,78],"multi-location":[13],"robot":[14,43,96],"rendezvous.":[15],"The":[16,45,83],"rendezvous":[17],"considered":[19],"can":[20],"be":[21],"structured":[22],"as":[23],"a":[24,30,74,94],"tree,":[25],"with":[26],"each":[27],"node":[28],"representing":[29],"meeting":[31,39,81],"robots,":[33],"and":[34,41,73,80,85],"computes":[37],"locations":[40],"connecting":[42],"trajectories.":[44],"tree":[46],"structure":[47],"is":[48],"exploited":[49],"by":[50],"using":[51],"compute":[55],"solutions":[56],"in":[57],"two":[58],"passes":[59],"through":[60],"tree:":[62],"upwards":[64],"pass":[65,76],"computing":[66,77],"cost":[68],"all":[70],"potential":[71],"solutions,":[72],"downwards":[75],"trajectories":[79],"locations.":[82],"correctness":[84],"efficiency":[86],"are":[90],"analyzed":[91],"theoretically,":[92],"while":[93],"continuous":[95],"arm":[97],"demonstrates":[99],"algorithm\u00bfs":[101],"practicality.":[102]},"counts_by_year":[{"year":2020,"cited_by_count":3},{"year":2014,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}