{"id":"https://openalex.org/W4285178132","doi":"https://doi.org/10.1109/lra.2022.3187265","title":"Prioritized Safe Interval Path Planning for Multi-Agent Pathfinding With Continuous Time on 2D Roadmaps","display_name":"Prioritized Safe Interval Path Planning for Multi-Agent Pathfinding With Continuous Time on 2D Roadmaps","publication_year":2022,"publication_date":"2022-06-30","ids":{"openalex":"https://openalex.org/W4285178132","doi":"https://doi.org/10.1109/lra.2022.3187265"},"language":"en","primary_location":{"id":"doi:10.1109/lra.2022.3187265","is_oa":true,"landing_page_url":"https://doi.org/10.1109/lra.2022.3187265","pdf_url":"https://ieeexplore.ieee.org/ielx7/7083369/9831196/09811344.pdf","source":{"id":"https://openalex.org/S4210169774","display_name":"IEEE Robotics and Automation Letters","issn_l":"2377-3766","issn":["2377-3766"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Robotics and Automation Letters","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"hybrid","oa_url":"https://ieeexplore.ieee.org/ielx7/7083369/9831196/09811344.pdf","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5083407612","display_name":"Kazumi Kasaura","orcid":"https://orcid.org/0000-0002-3219-9961"},"institutions":[{"id":"https://openalex.org/I146230289","display_name":"Omron (Japan)","ror":"https://ror.org/00q0w1h45","country_code":"JP","type":"company","lineage":["https://openalex.org/I146230289"]}],"countries":["JP"],"is_corresponding":true,"raw_author_name":"Kazumi Kasaura","raw_affiliation_strings":["OMRON SINIC X Corporation, Tokyo, Japan"],"raw_orcid":"https://orcid.org/0000-0002-3219-9961","affiliations":[{"raw_affiliation_string":"OMRON SINIC X Corporation, Tokyo, Japan","institution_ids":["https://openalex.org/I146230289"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5081074221","display_name":"Mai Nishimura","orcid":"https://orcid.org/0000-0003-2859-988X"},"institutions":[{"id":"https://openalex.org/I146230289","display_name":"Omron (Japan)","ror":"https://ror.org/00q0w1h45","country_code":"JP","type":"company","lineage":["https://openalex.org/I146230289"]}],"countries":["JP"],"is_corresponding":false,"raw_author_name":"Mai Nishimura","raw_affiliation_strings":["OMRON SINIC X Corporation, Tokyo, Japan"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"OMRON SINIC X Corporation, Tokyo, Japan","institution_ids":["https://openalex.org/I146230289"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5020282208","display_name":"Ryo Yonetani","orcid":"https://orcid.org/0000-0002-2724-6233"},"institutions":[{"id":"https://openalex.org/I146230289","display_name":"Omron (Japan)","ror":"https://ror.org/00q0w1h45","country_code":"JP","type":"company","lineage":["https://openalex.org/I146230289"]}],"countries":["JP"],"is_corresponding":false,"raw_author_name":"Ryo Yonetani","raw_affiliation_strings":["OMRON SINIC X Corporation, Tokyo, Japan"],"raw_orcid":"https://orcid.org/0000-0002-2724-6233","affiliations":[{"raw_affiliation_string":"OMRON SINIC X Corporation, Tokyo, Japan","institution_ids":["https://openalex.org/I146230289"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5083407612"],"corresponding_institution_ids":["https://openalex.org/I146230289"],"apc_list":null,"apc_paid":null,"fwci":2.7551,"has_fulltext":true,"cited_by_count":29,"citation_normalized_percentile":{"value":0.91713252,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":94,"max":99},"biblio":{"volume":"7","issue":"4","first_page":"10494","last_page":"10501"},"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.9646000266075134,"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/T11714","display_name":"Multimodal Machine Learning Applications","score":0.9607999920845032,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/motion-planning","display_name":"Motion planning","score":0.7612462043762207},{"id":"https://openalex.org/keywords/scalability","display_name":"Scalability","score":0.7470566034317017},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6950328946113586},{"id":"https://openalex.org/keywords/interval","display_name":"Interval (graph theory)","score":0.6739052534103394},{"id":"https://openalex.org/keywords/pathfinding","display_name":"Pathfinding","score":0.6134896278381348},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.5926939845085144},{"id":"https://openalex.org/keywords/grid","display_name":"Grid","score":0.589921236038208},{"id":"https://openalex.org/keywords/collision","display_name":"Collision","score":0.4676596224308014},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.4051046371459961},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.3764944076538086},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.329603910446167},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.27896544337272644},{"id":"https://openalex.org/keywords/robot","display_name":"Robot","score":0.2666669487953186},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.21133321523666382},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.1577777862548828},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.15264073014259338}],"concepts":[{"id":"https://openalex.org/C81074085","wikidata":"https://www.wikidata.org/wiki/Q366872","display_name":"Motion planning","level":3,"score":0.7612462043762207},{"id":"https://openalex.org/C48044578","wikidata":"https://www.wikidata.org/wiki/Q727490","display_name":"Scalability","level":2,"score":0.7470566034317017},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6950328946113586},{"id":"https://openalex.org/C2778067643","wikidata":"https://www.wikidata.org/wiki/Q166507","display_name":"Interval (graph theory)","level":2,"score":0.6739052534103394},{"id":"https://openalex.org/C25321074","wikidata":"https://www.wikidata.org/wiki/Q1969601","display_name":"Pathfinding","level":4,"score":0.6134896278381348},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5926939845085144},{"id":"https://openalex.org/C187691185","wikidata":"https://www.wikidata.org/wiki/Q2020720","display_name":"Grid","level":2,"score":0.589921236038208},{"id":"https://openalex.org/C121704057","wikidata":"https://www.wikidata.org/wiki/Q352070","display_name":"Collision","level":2,"score":0.4676596224308014},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4051046371459961},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.3764944076538086},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.329603910446167},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.27896544337272644},{"id":"https://openalex.org/C90509273","wikidata":"https://www.wikidata.org/wiki/Q11012","display_name":"Robot","level":2,"score":0.2666669487953186},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.21133321523666382},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.1577777862548828},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.15264073014259338},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.0},{"id":"https://openalex.org/C38652104","wikidata":"https://www.wikidata.org/wiki/Q3510521","display_name":"Computer security","level":1,"score":0.0},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.0},{"id":"https://openalex.org/C77088390","wikidata":"https://www.wikidata.org/wiki/Q8513","display_name":"Database","level":1,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/lra.2022.3187265","is_oa":true,"landing_page_url":"https://doi.org/10.1109/lra.2022.3187265","pdf_url":"https://ieeexplore.ieee.org/ielx7/7083369/9831196/09811344.pdf","source":{"id":"https://openalex.org/S4210169774","display_name":"IEEE Robotics and Automation Letters","issn_l":"2377-3766","issn":["2377-3766"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Robotics and Automation Letters","raw_type":"journal-article"}],"best_oa_location":{"id":"doi:10.1109/lra.2022.3187265","is_oa":true,"landing_page_url":"https://doi.org/10.1109/lra.2022.3187265","pdf_url":"https://ieeexplore.ieee.org/ielx7/7083369/9831196/09811344.pdf","source":{"id":"https://openalex.org/S4210169774","display_name":"IEEE Robotics and Automation Letters","issn_l":"2377-3766","issn":["2377-3766"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Robotics and Automation Letters","raw_type":"journal-article"},"sustainable_development_goals":[{"score":0.6000000238418579,"id":"https://metadata.un.org/sdg/11","display_name":"Sustainable cities and communities"}],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4285178132.pdf","grobid_xml":"https://content.openalex.org/works/W4285178132.grobid-xml"},"referenced_works_count":41,"referenced_works":["https://openalex.org/W1497695555","https://openalex.org/W1531225991","https://openalex.org/W1874694348","https://openalex.org/W1971086298","https://openalex.org/W1973396716","https://openalex.org/W1989407213","https://openalex.org/W2038498300","https://openalex.org/W2055014394","https://openalex.org/W2094360223","https://openalex.org/W2123030512","https://openalex.org/W2128990851","https://openalex.org/W2155313135","https://openalex.org/W2159524963","https://openalex.org/W2166462345","https://openalex.org/W2168424616","https://openalex.org/W2293509456","https://openalex.org/W2596153517","https://openalex.org/W2730530972","https://openalex.org/W2737170301","https://openalex.org/W2808589448","https://openalex.org/W2886374915","https://openalex.org/W2903998385","https://openalex.org/W2914296650","https://openalex.org/W2964997335","https://openalex.org/W2965230525","https://openalex.org/W2966227502","https://openalex.org/W2980480328","https://openalex.org/W2981057983","https://openalex.org/W3014460461","https://openalex.org/W3037164939","https://openalex.org/W3086385542","https://openalex.org/W3099318416","https://openalex.org/W3166102866","https://openalex.org/W3190828211","https://openalex.org/W3198009177","https://openalex.org/W3204394164","https://openalex.org/W4205985266","https://openalex.org/W4288254753","https://openalex.org/W6750878852","https://openalex.org/W6769268775","https://openalex.org/W6809858958"],"related_works":["https://openalex.org/W4285687848","https://openalex.org/W4289994039","https://openalex.org/W4391130068","https://openalex.org/W2240526870","https://openalex.org/W3100156731","https://openalex.org/W2623016776","https://openalex.org/W1967962134","https://openalex.org/W3128311703","https://openalex.org/W3101047024","https://openalex.org/W131718761"],"abstract_inverted_index":{"We":[0,118],"address":[1],"a":[2,14,52,70,92,101,189,203],"challenging":[3],"multi-agent":[4],"pathfinding":[5],"(MAPF)":[6],"problem":[7,43],"for":[8,24,148],"hundreds":[9],"of":[10,48,176,191,198],"agents":[11],"moving":[12],"on":[13,51,77,202],"2D":[15,79],"roadmap":[16,80],"with":[17,64,108,130,158,206],"continuous":[18,159],"time.":[19],"Despite":[20],"its":[21],"known":[22],"potential":[23],"producing":[25],"better":[26],"solutions":[27],"compared":[28],"to":[29,40,45,75,142],"typical":[30],"grid":[31],"and":[32,81,105,124,127,151,153,180],"discrete-time":[33],"cases,":[34],"few":[35],"approaches":[36],"have":[37],"been":[38],"established":[39],"solve":[41],"this":[42,56],"due":[44],"the":[46,78,131,196,199],"intractability":[47],"collision":[49,87],"checks":[50],"large":[53],"scale.":[54],"In":[55],"work,":[57],"we":[58,193],"propose":[59],"Prioritized":[60],"Safe-Interval":[61],"Path":[62],"Planning":[63],"Continuous-Time":[65,96],"Conflicts":[66],"(PSIPP/CTC)":[67],"that":[68,168],"extends":[69],"scalable":[71],"prioritized":[72,162],"planning":[73,136,177],"algorithm":[74],"work":[76],"continuous-time":[82,109],"setup":[83],"by":[84],"alleviating":[85],"intensive":[86],"checks.":[88],"Our":[89],"approach":[90,201],"involves":[91],"novel":[93],"concept":[94],"named":[95],"Conflict":[97],"(CTC),":[98],"which":[99,112],"describes":[100],"pair":[102],"among":[103],"vertices":[104,150],"edges":[106,152],"associated":[107],"intervals":[110,147],"within":[111],"collisions":[113],"can":[114],"happen":[115],"between":[116],"agents.":[117],"pre-compute":[119],"CTCs":[120,132],"using":[121],"geometric":[122],"neighbor-search":[123],"sweeping":[125],"techniques":[126],"annotate":[128],"roadmaps":[129],"just":[133],"once":[134],"before":[135],"starts.":[137],"Doing":[138],"so":[139],"allows":[140],"us":[141],"efficiently":[143],"enumerate":[144],"collision-free":[145],"time":[146,160],"all":[149],"find":[154],"each":[155],"agent's":[156],"path":[157],"in":[161,174],"planning.":[163],"Extensive":[164],"experimental":[165],"evaluations":[166],"demonstrate":[167],"PSIPP/CTC":[169],"significantly":[170],"outperforms":[171],"existing":[172],"methods":[173],"terms":[175],"success":[178],"rate":[179],"runtime":[181],"while":[182],"maintaining":[183],"an":[184],"acceptable":[185],"solution":[186],"quality.":[187],"As":[188],"proof":[190],"concept,":[192],"also":[194],"confirmed":[195],"effectiveness":[197],"proposed":[200],"physics":[204],"simulation":[205],"differential":[207],"wheeled":[208],"robots.":[209]},"counts_by_year":[{"year":2026,"cited_by_count":2},{"year":2025,"cited_by_count":12},{"year":2024,"cited_by_count":8},{"year":2023,"cited_by_count":5},{"year":2022,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}