{"id":"https://openalex.org/W7167051190","doi":"https://doi.org/10.48550/arxiv.2607.00444","title":"Search-Based Spatiotemporal and Multi-Robot Motion Planning on Graphs of Space-Time Convex Sets","display_name":"Search-Based Spatiotemporal and Multi-Robot Motion Planning on Graphs of Space-Time Convex Sets","publication_year":2026,"publication_date":"2026-07-01","ids":{"openalex":"https://openalex.org/W7167051190","doi":"https://doi.org/10.48550/arxiv.2607.00444"},"language":null,"primary_location":{"id":"doi:10.48550/arxiv.2607.00444","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2607.00444","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Preprint"},"type":"preprint","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://doi.org/10.48550/arxiv.2607.00444","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5139919972","display_name":"Jingtao Tang","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Tang, Jingtao","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5139933458","display_name":"Zining Mao","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Mao, Zining","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5123198425","display_name":"L Yang","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Yang, Lufan","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5139933723","display_name":"Hang Ma","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Ma, Hang","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":0.984499990940094,"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.984499990940094,"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.0017999999690800905,"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/T10462","display_name":"Reinforcement Learning in Robotics","score":0.00139999995008111,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/heuristics","display_name":"Heuristics","score":0.6614999771118164},{"id":"https://openalex.org/keywords/motion-planning","display_name":"Motion planning","score":0.6538000106811523},{"id":"https://openalex.org/keywords/solver","display_name":"Solver","score":0.6237999796867371},{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.6118000149726868},{"id":"https://openalex.org/keywords/robot","display_name":"Robot","score":0.517799973487854},{"id":"https://openalex.org/keywords/trajectory","display_name":"Trajectory","score":0.4968000054359436},{"id":"https://openalex.org/keywords/scheme","display_name":"Scheme (mathematics)","score":0.4708000123500824},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.4422000050544739}],"concepts":[{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.6614999771118164},{"id":"https://openalex.org/C81074085","wikidata":"https://www.wikidata.org/wiki/Q366872","display_name":"Motion planning","level":3,"score":0.6538000106811523},{"id":"https://openalex.org/C2778770139","wikidata":"https://www.wikidata.org/wiki/Q1966904","display_name":"Solver","level":2,"score":0.6237999796867371},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.6118000149726868},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5467000007629395},{"id":"https://openalex.org/C90509273","wikidata":"https://www.wikidata.org/wiki/Q11012","display_name":"Robot","level":2,"score":0.517799973487854},{"id":"https://openalex.org/C13662910","wikidata":"https://www.wikidata.org/wiki/Q193139","display_name":"Trajectory","level":2,"score":0.4968000054359436},{"id":"https://openalex.org/C77618280","wikidata":"https://www.wikidata.org/wiki/Q1155772","display_name":"Scheme (mathematics)","level":2,"score":0.4708000123500824},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.46810001134872437},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.4422000050544739},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.39570000767707825},{"id":"https://openalex.org/C104114177","wikidata":"https://www.wikidata.org/wiki/Q79782","display_name":"Motion (physics)","level":2,"score":0.37549999356269836},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.37220001220703125},{"id":"https://openalex.org/C157972887","wikidata":"https://www.wikidata.org/wiki/Q463359","display_name":"Convex optimization","level":3,"score":0.3343999981880188},{"id":"https://openalex.org/C71559656","wikidata":"https://www.wikidata.org/wiki/Q671298","display_name":"Divide and conquer algorithms","level":2,"score":0.30630001425743103},{"id":"https://openalex.org/C124681953","wikidata":"https://www.wikidata.org/wiki/Q339062","display_name":"Decomposition","level":2,"score":0.2987000048160553},{"id":"https://openalex.org/C111110010","wikidata":"https://www.wikidata.org/wiki/Q2627315","display_name":"Convex combination","level":4,"score":0.2671999931335449},{"id":"https://openalex.org/C2776359362","wikidata":"https://www.wikidata.org/wiki/Q2145286","display_name":"Representation (politics)","level":3,"score":0.2605000138282776},{"id":"https://openalex.org/C49870271","wikidata":"https://www.wikidata.org/wiki/Q193657","display_name":"Convex set","level":4,"score":0.25859999656677246},{"id":"https://openalex.org/C2780799671","wikidata":"https://www.wikidata.org/wiki/Q17087362","display_name":"Transient (computer programming)","level":2,"score":0.2581000030040741},{"id":"https://openalex.org/C2776999362","wikidata":"https://www.wikidata.org/wiki/Q2349274","display_name":"Planner","level":2,"score":0.2535000145435333}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.48550/arxiv.2607.00444","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2607.00444","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"Preprint"}],"best_oa_location":{"id":"doi:10.48550/arxiv.2607.00444","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2607.00444","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Preprint"},"sustainable_development_goals":[{"score":0.6029799580574036,"id":"https://metadata.un.org/sdg/11","display_name":"Sustainable cities and communities"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"Spatiotemporal":[0],"motion":[1,131,187],"planning,":[2,132],"especially":[3],"in":[4,21,53,118,171],"multi-robot":[5,127,130,157,186],"settings,":[6],"requires":[7],"robots":[8,196],"to":[9,58,114,149,194],"reason":[10],"about":[11],"collision-free":[12,46],"regions":[13,26,47],"that":[14,90,183],"change":[15],"over":[16,81,162],"time,":[17],"which":[18],"is":[19],"challenging":[20],"continuous":[22,65,95],"spaces":[23],"when":[24],"feasible":[25,177],"are":[27,48],"transient":[28,176],"and":[29,55,84,102,126,137,143,156,175],"geometrically":[30],"constrained.":[31],"We":[32,71,105],"present":[33,107],"an":[34,108],"algorithmic":[35],"framework":[36],"based":[37],"on":[38,60,75,154],"graphs":[39],"of":[40,123],"space-time":[41,54],"convex":[42,51],"sets":[43,52],"(ST-GCSs),":[44],"where":[45],"represented":[49],"as":[50,77],"trajectories":[56],"correspond":[57],"paths":[59,93],"the":[61,68,184],"graph":[62],"together":[63],"with":[64,173,192],"motions":[66],"within":[67,197],"selected":[69],"sets.":[70],"formulate":[72],"time-optimal":[73],"planning":[74,136,141],"ST-GCSs":[76],"a":[78,86,145,199],"graph-search":[79],"problem":[80],"path-indexed":[82],"states":[83],"develop":[85],"best-first":[87],"search":[88],"solver":[89],"evaluates":[91],"partial":[92],"via":[94],"trajectory":[96,116],"optimization,":[97],"guided":[98],"by":[99],"admissible":[100],"heuristics":[101],"dominance":[103],"checks.":[104],"further":[106,181],"Exact":[109],"Convex":[110],"Decomposition":[111],"(ECD)":[112],"scheme":[113,148],"reserve":[115],"occupancies":[117],"space-time,":[119],"enabling":[120],"unified":[121],"handling":[122],"dynamic":[124],"obstacles":[125],"interactions.":[128],"For":[129],"we":[133],"integrate":[134],"ST-GCS":[135],"ECD":[138],"into":[139],"prioritized":[140],"methods":[142],"introduce":[144],"windowed":[146],"coordination":[147],"improve":[150],"efficiency.":[151],"Extensive":[152],"experiments":[153],"single-robot":[155],"problems":[158],"demonstrate":[159],"substantial":[160],"speedups":[161],"various":[163],"planners":[164],"while":[165],"maintaining":[166],"high":[167],"solution":[168],"quality,":[169],"particularly":[170],"environments":[172],"narrow":[174],"regions.":[178],"Large-scale":[179],"demonstrations":[180],"show":[182],"proposed":[185],"planner":[188],"can":[189],"solve":[190],"instances":[191],"up":[193],"$100$":[195],"only":[198],"few":[200],"minutes.":[201],"Project":[202],"homepage:":[203],"https://sites.google.com/view/stgcs":[204]},"counts_by_year":[],"updated_date":"2026-07-28T07:46:37.118299","created_date":"2026-07-03T00:00:00"}