{"id":"https://openalex.org/W1834384425","doi":"https://doi.org/10.1109/acc.2003.1244032","title":"Time-optimal graph traversal for two agents: when is formation travel beneficial?","display_name":"Time-optimal graph traversal for two agents: when is formation travel beneficial?","publication_year":2004,"publication_date":"2004-01-24","ids":{"openalex":"https://openalex.org/W1834384425","doi":"https://doi.org/10.1109/acc.2003.1244032","mag":"1834384425"},"language":"en","primary_location":{"id":"doi:10.1109/acc.2003.1244032","is_oa":false,"landing_page_url":"https://doi.org/10.1109/acc.2003.1244032","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2003 American Control Conference, 2003.","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/A5113584931","display_name":"Venkatesh G. Rao","orcid":null},"institutions":[{"id":"https://openalex.org/I27837315","display_name":"University of Michigan\u2013Ann Arbor","ror":"https://ror.org/00jmfr291","country_code":"US","type":"education","lineage":["https://openalex.org/I27837315"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"V.G. Rao","raw_affiliation_strings":["Department of Aerospace Engineering, University of Michigan, Ann Arbor, MI, USA","[Dept. of Aerosp. Eng., Michigan Univ., Ann Arbor, MI, USA]"],"affiliations":[{"raw_affiliation_string":"Department of Aerospace Engineering, University of Michigan, Ann Arbor, MI, USA","institution_ids":["https://openalex.org/I27837315"]},{"raw_affiliation_string":"[Dept. of Aerosp. Eng., Michigan Univ., Ann Arbor, MI, USA]","institution_ids":["https://openalex.org/I27837315"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5040839189","display_name":"Pierre T. Kabamba","orcid":null},"institutions":[{"id":"https://openalex.org/I27837315","display_name":"University of Michigan\u2013Ann Arbor","ror":"https://ror.org/00jmfr291","country_code":"US","type":"education","lineage":["https://openalex.org/I27837315"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"P.T. Kabamba","raw_affiliation_strings":["Department of Aerospace Engineering, University of Michigan, Ann Arbor, MI, USA","[Dept. of Aerosp. Eng., Michigan Univ., Ann Arbor, MI, USA]"],"affiliations":[{"raw_affiliation_string":"Department of Aerospace Engineering, University of Michigan, Ann Arbor, MI, USA","institution_ids":["https://openalex.org/I27837315"]},{"raw_affiliation_string":"[Dept. of Aerosp. Eng., Michigan Univ., Ann Arbor, MI, USA]","institution_ids":["https://openalex.org/I27837315"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5113584931"],"corresponding_institution_ids":["https://openalex.org/I27837315"],"apc_list":null,"apc_paid":null,"fwci":1.3665,"has_fulltext":false,"cited_by_count":7,"citation_normalized_percentile":{"value":0.81656413,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"4","issue":null,"first_page":"3254","last_page":"3259"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9988999962806702,"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.9988999962806702,"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/T10249","display_name":"Distributed Control Multi-Agent Systems","score":0.9979000091552734,"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/T12158","display_name":"Guidance and Control Systems","score":0.9886999726295471,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/traverse","display_name":"Traverse","score":0.8592191934585571},{"id":"https://openalex.org/keywords/tree-traversal","display_name":"Tree traversal","score":0.7245359420776367},{"id":"https://openalex.org/keywords/graph-traversal","display_name":"Graph traversal","score":0.69786536693573},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6537877321243286},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.582689106464386},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5171656012535095},{"id":"https://openalex.org/keywords/autonomous-agent","display_name":"Autonomous agent","score":0.45445016026496887},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.40695011615753174},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.23396539688110352},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.22278037667274475},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.21860697865486145}],"concepts":[{"id":"https://openalex.org/C176809094","wikidata":"https://www.wikidata.org/wiki/Q15401496","display_name":"Traverse","level":2,"score":0.8592191934585571},{"id":"https://openalex.org/C140745168","wikidata":"https://www.wikidata.org/wiki/Q1210082","display_name":"Tree traversal","level":2,"score":0.7245359420776367},{"id":"https://openalex.org/C96333769","wikidata":"https://www.wikidata.org/wiki/Q907955","display_name":"Graph traversal","level":3,"score":0.69786536693573},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6537877321243286},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.582689106464386},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5171656012535095},{"id":"https://openalex.org/C13687954","wikidata":"https://www.wikidata.org/wiki/Q4826847","display_name":"Autonomous agent","level":2,"score":0.45445016026496887},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.40695011615753174},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.23396539688110352},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.22278037667274475},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.21860697865486145},{"id":"https://openalex.org/C13280743","wikidata":"https://www.wikidata.org/wiki/Q131089","display_name":"Geodesy","level":1,"score":0.0},{"id":"https://openalex.org/C205649164","wikidata":"https://www.wikidata.org/wiki/Q1071","display_name":"Geography","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/acc.2003.1244032","is_oa":false,"landing_page_url":"https://doi.org/10.1109/acc.2003.1244032","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2003 American Control Conference, 2003.","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":4,"referenced_works":["https://openalex.org/W375300625","https://openalex.org/W1834384425","https://openalex.org/W2118425327","https://openalex.org/W3146599366"],"related_works":["https://openalex.org/W2200188075","https://openalex.org/W4252596799","https://openalex.org/W4254594467","https://openalex.org/W4230405657","https://openalex.org/W2552915643","https://openalex.org/W170547082","https://openalex.org/W3213135344","https://openalex.org/W2152421698","https://openalex.org/W2366394613","https://openalex.org/W244044452"],"abstract_inverted_index":{"This":[0],"paper":[1],"addresses":[2],"the":[3,38],"question,":[4],"\"when":[5],"and":[6,18],"how":[7],"should":[8],"autonomous":[9],"agents":[10,25],"engage":[11],"in":[12],"formation":[13,45],"travel?\"":[14],"Specifically,":[15],"we":[16],"formulate":[17],"solve":[19],"an":[20],"optimization":[21],"problem":[22,39],"for":[23,44],"two":[24,52],"traversing":[26],"a":[27],"graph,":[28],"under":[29],"joint":[30],"velocity":[31],"constraints.":[32],"The":[33,47],"results":[34],"are":[35],"applicable":[36],"to":[37],"of":[40],"constructing":[41],"optimal":[42],"trajectories":[43],"travel.":[46],"analysis":[48],"is":[49],"illustrated":[50],"by":[51],"examples.":[53]},"counts_by_year":[{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}