{"id":"https://openalex.org/W2138361531","doi":"https://doi.org/10.1109/robot.2004.1308892","title":"Exact Pareto-optimal coordination of two translating polygonal robots on an acyclic roadmap","display_name":"Exact Pareto-optimal coordination of two translating polygonal robots on an acyclic roadmap","publication_year":2004,"publication_date":"2004-01-01","ids":{"openalex":"https://openalex.org/W2138361531","doi":"https://doi.org/10.1109/robot.2004.1308892","mag":"2138361531"},"language":"en","primary_location":{"id":"doi:10.1109/robot.2004.1308892","is_oa":false,"landing_page_url":"https://doi.org/10.1109/robot.2004.1308892","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE International Conference on Robotics and Automation, 2004. Proceedings. ICRA '04. 2004","raw_type":"proceedings-article"},"type":"conference-paper","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/A5071143557","display_name":"H. Chitsaz","orcid":null},"institutions":[{"id":"https://openalex.org/I157725225","display_name":"University of Illinois Urbana-Champaign","ror":"https://ror.org/047426m28","country_code":"US","type":"education","lineage":["https://openalex.org/I157725225"]},{"id":"https://openalex.org/I183874917","display_name":"Urbana University","ror":"https://ror.org/04kp3hw27","country_code":"US","type":"education","lineage":["https://openalex.org/I183874917"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"H. Chitsaz","raw_affiliation_strings":["Department of Computer Science, University of Illinois, Urbana-Champaign, IL, USA","Dept. of Comput. Sci., Illinois Univ., Urbana, IL, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Illinois, Urbana-Champaign, IL, USA","institution_ids":["https://openalex.org/I157725225"]},{"raw_affiliation_string":"Dept. of Comput. Sci., Illinois Univ., Urbana, IL, USA","institution_ids":["https://openalex.org/I183874917"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5089976123","display_name":"Jason M. O\u2019Kane","orcid":"https://orcid.org/0000-0002-1536-4822"},"institutions":[{"id":"https://openalex.org/I157725225","display_name":"University of Illinois Urbana-Champaign","ror":"https://ror.org/047426m28","country_code":"US","type":"education","lineage":["https://openalex.org/I157725225"]},{"id":"https://openalex.org/I183874917","display_name":"Urbana University","ror":"https://ror.org/04kp3hw27","country_code":"US","type":"education","lineage":["https://openalex.org/I183874917"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"J.M. O'Kane","raw_affiliation_strings":["Department of Computer Science, University of Illinois, Urbana-Champaign, IL, USA","Dept. of Comput. Sci., Illinois Univ., Urbana, IL, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Illinois, Urbana-Champaign, IL, USA","institution_ids":["https://openalex.org/I157725225"]},{"raw_affiliation_string":"Dept. of Comput. Sci., Illinois Univ., Urbana, IL, USA","institution_ids":["https://openalex.org/I183874917"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5065104734","display_name":"Steven M. LaValle","orcid":"https://orcid.org/0000-0003-4841-2584"},"institutions":[{"id":"https://openalex.org/I157725225","display_name":"University of Illinois Urbana-Champaign","ror":"https://ror.org/047426m28","country_code":"US","type":"education","lineage":["https://openalex.org/I157725225"]},{"id":"https://openalex.org/I183874917","display_name":"Urbana University","ror":"https://ror.org/04kp3hw27","country_code":"US","type":"education","lineage":["https://openalex.org/I183874917"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"S.M. LaValle","raw_affiliation_strings":["Department of Computer Science, University of Illinois, Urbana-Champaign, IL, USA","Dept. of Comput. Sci., Illinois Univ., Urbana, IL, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Illinois, Urbana-Champaign, IL, USA","institution_ids":["https://openalex.org/I157725225"]},{"raw_affiliation_string":"Dept. of Comput. Sci., Illinois Univ., Urbana, IL, USA","institution_ids":["https://openalex.org/I183874917"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":2.1404,"has_fulltext":false,"cited_by_count":18,"citation_normalized_percentile":{"value":0.88221511,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":"24","issue":null,"first_page":"3981","last_page":"3986 Vol.4"},"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/T12784","display_name":"Modular Robots and Swarm Intelligence","score":0.9990000128746033,"subfield":{"id":"https://openalex.org/subfields/2210","display_name":"Mechanical 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.9957000017166138,"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/robot","display_name":"Robot","score":0.8040025234222412},{"id":"https://openalex.org/keywords/piecewise","display_name":"Piecewise","score":0.6333097219467163},{"id":"https://openalex.org/keywords/pareto-optimal","display_name":"Pareto optimal","score":0.5896062850952148},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.5635998845100403},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5379517674446106},{"id":"https://openalex.org/keywords/pareto-principle","display_name":"Pareto principle","score":0.5244374871253967},{"id":"https://openalex.org/keywords/piecewise-linear-function","display_name":"Piecewise linear function","score":0.4968314468860626},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4616275131702423},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4550723135471344},{"id":"https://openalex.org/keywords/plane","display_name":"Plane (geometry)","score":0.45414304733276367},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.41212761402130127},{"id":"https://openalex.org/keywords/multi-objective-optimization","display_name":"Multi-objective optimization","score":0.27497535943984985},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.15443986654281616},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.08760809898376465}],"concepts":[{"id":"https://openalex.org/C90509273","wikidata":"https://www.wikidata.org/wiki/Q11012","display_name":"Robot","level":2,"score":0.8040025234222412},{"id":"https://openalex.org/C164660894","wikidata":"https://www.wikidata.org/wiki/Q2037833","display_name":"Piecewise","level":2,"score":0.6333097219467163},{"id":"https://openalex.org/C2986314615","wikidata":"https://www.wikidata.org/wiki/Q36829","display_name":"Pareto optimal","level":3,"score":0.5896062850952148},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.5635998845100403},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5379517674446106},{"id":"https://openalex.org/C137635306","wikidata":"https://www.wikidata.org/wiki/Q182667","display_name":"Pareto principle","level":2,"score":0.5244374871253967},{"id":"https://openalex.org/C17095337","wikidata":"https://www.wikidata.org/wiki/Q2375229","display_name":"Piecewise linear function","level":2,"score":0.4968314468860626},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4616275131702423},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4550723135471344},{"id":"https://openalex.org/C17825722","wikidata":"https://www.wikidata.org/wiki/Q17285","display_name":"Plane (geometry)","level":2,"score":0.45414304733276367},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.41212761402130127},{"id":"https://openalex.org/C68781425","wikidata":"https://www.wikidata.org/wiki/Q2052203","display_name":"Multi-objective optimization","level":2,"score":0.27497535943984985},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.15443986654281616},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.08760809898376465},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","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":7,"locations":[{"id":"doi:10.1109/robot.2004.1308892","is_oa":false,"landing_page_url":"https://doi.org/10.1109/robot.2004.1308892","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE International Conference on Robotics and Automation, 2004. Proceedings. ICRA '04. 2004","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.1.8323","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.1.8323","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://msl.cs.uiuc.edu/~chitsaz/pubs/ChiOkaLav04.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.110.3203","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.110.3203","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://msl.cs.uiuc.edu/~lavalle/papers/ChiOkaLav06.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.144.941","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.144.941","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://msl.cs.uiuc.edu/~lavalle/papers/ChiLavOka08.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.419.6565","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.419.6565","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://cccg.ca/proceedings/2008/paper44.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.594.865","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.594.865","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cse.sc.edu/~jokane/papers/icra04.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.61.6703","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.61.6703","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://msl.cs.uiuc.edu/~lavalle/papers/ChiOkaLav04.ps.gz","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"},{"id":"https://openalex.org/F4320337345","display_name":"Office of Naval Research","ror":"https://ror.org/00rk2pe57"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":36,"referenced_works":["https://openalex.org/W206461320","https://openalex.org/W1516275525","https://openalex.org/W1566800662","https://openalex.org/W1628078591","https://openalex.org/W1903576784","https://openalex.org/W1978301848","https://openalex.org/W1999730797","https://openalex.org/W2022020194","https://openalex.org/W2045403423","https://openalex.org/W2058510050","https://openalex.org/W2064943409","https://openalex.org/W2103929204","https://openalex.org/W2113952543","https://openalex.org/W2116446610","https://openalex.org/W2117496121","https://openalex.org/W2124299914","https://openalex.org/W2129668160","https://openalex.org/W2135647874","https://openalex.org/W2141967156","https://openalex.org/W2143031621","https://openalex.org/W2148719714","https://openalex.org/W2149906774","https://openalex.org/W2151288708","https://openalex.org/W2152358681","https://openalex.org/W2158844420","https://openalex.org/W2166462345","https://openalex.org/W2167427782","https://openalex.org/W2169742265","https://openalex.org/W2608308300","https://openalex.org/W2802620382","https://openalex.org/W4214494916","https://openalex.org/W4235484205","https://openalex.org/W4244044799","https://openalex.org/W4300449797","https://openalex.org/W6636833525","https://openalex.org/W6681174121"],"related_works":["https://openalex.org/W2133947431","https://openalex.org/W2490196280","https://openalex.org/W3182827720","https://openalex.org/W1596838019","https://openalex.org/W3208509670","https://openalex.org/W1963790170","https://openalex.org/W2109304297","https://openalex.org/W2073298047","https://openalex.org/W2033790662","https://openalex.org/W2586328217"],"abstract_inverted_index":{"We":[0],"present":[1],"an":[2],"algorithm":[3,82],"that":[4,75],"computes":[5,83],"the":[6,19,32,67,96,101,105],"complete":[7],"set":[8],"of":[9,25,45,98,107],"Pareto-optimal":[10,64],"coordination":[11,108],"strategies":[12],"for":[13,69,78],"two":[14,33,50],"translating":[15],"polygonal":[16],"robots":[17,34,37],"in":[18,86,92,100],"plane.":[20],"A":[21],"collision-free":[22],"acyclic":[23],"roadmap":[24],"piecewise-linear":[26],"paths":[27,99],"is":[28,95,104,113],"given":[29],"on":[30],"which":[31,70,93],"move.":[35],"The":[36,63,81],"have":[38],"a":[39],"maximum":[40],"speed":[41],"and":[42],"are":[43,66,76],"capable":[44],"instantly":[46],"switching":[47],"between":[48],"any":[49],"arbitrary":[51],"speeds.":[52],"Each":[53],"robot":[54],"would":[55],"like":[56],"to":[57],"minimize":[58],"its":[59],"travel":[60],"time":[61,87],"independently.":[62],"solutions":[65,74,85],"ones":[68],"there":[71],"exist":[72],"no":[73],"better":[77],"both":[79],"robots.":[80],"exact":[84],"O(mn/sup":[88],"2/":[89],"log":[90],"n),":[91],"m":[94],"number":[97,106],"roadmap,":[102],"n":[103],"space":[109],"vertices.":[110],"An":[111],"implementation":[112],"presented.":[114]},"counts_by_year":[{"year":2019,"cited_by_count":1},{"year":2016,"cited_by_count":1}],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}