{"id":"https://openalex.org/W4417098927","doi":"https://doi.org/10.1109/tase.2026.3688563","title":"WinkTPG: An Execution Framework for Multi-Agent Path Finding Using Temporal Reasoning","display_name":"WinkTPG: An Execution Framework for Multi-Agent Path Finding Using Temporal Reasoning","publication_year":2026,"publication_date":"2026-01-01","ids":{"openalex":"https://openalex.org/W4417098927","doi":"https://doi.org/10.1109/tase.2026.3688563"},"language":"en","primary_location":{"id":"doi:10.1109/tase.2026.3688563","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tase.2026.3688563","pdf_url":null,"source":{"id":"https://openalex.org/S34881539","display_name":"IEEE Transactions on Automation Science and Engineering","issn_l":"1545-5955","issn":["1545-5955","1558-3783"],"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":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Automation Science and Engineering","raw_type":"journal-article"},"type":"article","indexed_in":["arxiv","crossref","datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/2508.01495","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5080145345","display_name":"Jingtian Yan","orcid":"https://orcid.org/0000-0001-6717-2788"},"institutions":[{"id":"https://openalex.org/I74973139","display_name":"Carnegie Mellon University","ror":"https://ror.org/05x2bcf33","country_code":"US","type":"education","lineage":["https://openalex.org/I74973139"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Jingtian Yan","raw_affiliation_strings":["Robotics Institute, Carnegie Mellon University, Pittsburgh, PA, USA"],"raw_orcid":"https://orcid.org/0000-0001-6717-2788","affiliations":[{"raw_affiliation_string":"Robotics Institute, Carnegie Mellon University, Pittsburgh, PA, USA","institution_ids":["https://openalex.org/I74973139"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5043058554","display_name":"Stephen F. Smith","orcid":"https://orcid.org/0000-0002-7053-3166"},"institutions":[{"id":"https://openalex.org/I74973139","display_name":"Carnegie Mellon University","ror":"https://ror.org/05x2bcf33","country_code":"US","type":"education","lineage":["https://openalex.org/I74973139"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Stephen F. Smith","raw_affiliation_strings":["Robotics Institute, Carnegie Mellon University, Pittsburgh, PA, USA"],"raw_orcid":"https://orcid.org/0000-0002-7053-3166","affiliations":[{"raw_affiliation_string":"Robotics Institute, Carnegie Mellon University, Pittsburgh, PA, USA","institution_ids":["https://openalex.org/I74973139"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5101499733","display_name":"Jiaoyang Li","orcid":"https://orcid.org/0000-0002-0032-1758"},"institutions":[{"id":"https://openalex.org/I74973139","display_name":"Carnegie Mellon University","ror":"https://ror.org/05x2bcf33","country_code":"US","type":"education","lineage":["https://openalex.org/I74973139"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Jiaoyang Li","raw_affiliation_strings":["Robotics Institute, Carnegie Mellon University, Pittsburgh, PA, USA"],"raw_orcid":"https://orcid.org/0000-0002-0032-1758","affiliations":[{"raw_affiliation_string":"Robotics Institute, Carnegie Mellon University, Pittsburgh, PA, USA","institution_ids":["https://openalex.org/I74973139"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I74973139"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.0182375,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"23","issue":null,"first_page":"9162","last_page":"9175"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9713000059127808,"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.9713000059127808,"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/T10906","display_name":"AI-based Problem Solving and Planning","score":0.002099999925121665,"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"}},{"id":"https://openalex.org/T13362","display_name":"Slime Mold and Myxomycetes Research","score":0.002099999925121665,"subfield":{"id":"https://openalex.org/subfields/2204","display_name":"Biomedical 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/path","display_name":"Path (computing)","score":0.5525000095367432},{"id":"https://openalex.org/keywords/plan","display_name":"Plan (archaeology)","score":0.5177000164985657},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4876999855041504},{"id":"https://openalex.org/keywords/unexpected-events","display_name":"Unexpected events","score":0.444599986076355},{"id":"https://openalex.org/keywords/quality","display_name":"Quality (philosophy)","score":0.43470001220703125},{"id":"https://openalex.org/keywords/execution-time","display_name":"Execution time","score":0.4180000126361847},{"id":"https://openalex.org/keywords/sequence","display_name":"Sequence (biology)","score":0.3513999879360199},{"id":"https://openalex.org/keywords/motion-planning","display_name":"Motion planning","score":0.3393999934196472}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6894999742507935},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5525000095367432},{"id":"https://openalex.org/C2776505523","wikidata":"https://www.wikidata.org/wiki/Q4785468","display_name":"Plan (archaeology)","level":2,"score":0.5177000164985657},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4876999855041504},{"id":"https://openalex.org/C2776544517","wikidata":"https://www.wikidata.org/wiki/Q189447","display_name":"Unexpected events","level":2,"score":0.444599986076355},{"id":"https://openalex.org/C2779530757","wikidata":"https://www.wikidata.org/wiki/Q1207505","display_name":"Quality (philosophy)","level":2,"score":0.43470001220703125},{"id":"https://openalex.org/C2989134064","wikidata":"https://www.wikidata.org/wiki/Q288510","display_name":"Execution time","level":2,"score":0.4180000126361847},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.36719998717308044},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.35409998893737793},{"id":"https://openalex.org/C2778112365","wikidata":"https://www.wikidata.org/wiki/Q3511065","display_name":"Sequence (biology)","level":2,"score":0.3513999879360199},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3490000069141388},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3416999876499176},{"id":"https://openalex.org/C81074085","wikidata":"https://www.wikidata.org/wiki/Q366872","display_name":"Motion planning","level":3,"score":0.3393999934196472},{"id":"https://openalex.org/C2777212361","wikidata":"https://www.wikidata.org/wiki/Q5127848","display_name":"Class (philosophy)","level":2,"score":0.3305000066757202},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.3237000107765198},{"id":"https://openalex.org/C41550386","wikidata":"https://www.wikidata.org/wiki/Q529909","display_name":"Multi-agent system","level":2,"score":0.31839999556541443},{"id":"https://openalex.org/C100776233","wikidata":"https://www.wikidata.org/wiki/Q2532492","display_name":"Bridge (graph theory)","level":2,"score":0.30550000071525574},{"id":"https://openalex.org/C146380142","wikidata":"https://www.wikidata.org/wiki/Q1137726","display_name":"Directed graph","level":2,"score":0.28290000557899475},{"id":"https://openalex.org/C114073186","wikidata":"https://www.wikidata.org/wiki/Q2631895","display_name":"Automated planning and scheduling","level":2,"score":0.2750000059604645},{"id":"https://openalex.org/C26517878","wikidata":"https://www.wikidata.org/wiki/Q228039","display_name":"Key (lock)","level":2,"score":0.2727000117301941},{"id":"https://openalex.org/C147764199","wikidata":"https://www.wikidata.org/wiki/Q6865248","display_name":"Minification","level":2,"score":0.25130000710487366},{"id":"https://openalex.org/C3018263672","wikidata":"https://www.wikidata.org/wiki/Q1296251","display_name":"Efficient algorithm","level":2,"score":0.25040000677108765},{"id":"https://openalex.org/C77618280","wikidata":"https://www.wikidata.org/wiki/Q1155772","display_name":"Scheme (mathematics)","level":2,"score":0.2500999867916107}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1109/tase.2026.3688563","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tase.2026.3688563","pdf_url":null,"source":{"id":"https://openalex.org/S34881539","display_name":"IEEE Transactions on Automation Science and Engineering","issn_l":"1545-5955","issn":["1545-5955","1558-3783"],"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":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Automation Science and Engineering","raw_type":"journal-article"},{"id":"pmh:oai:arXiv.org:2508.01495","is_oa":true,"landing_page_url":"https://arxiv.org/abs/2508.01495","pdf_url":"https://arxiv.org/pdf/2508.01495","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"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":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},{"id":"doi:10.48550/arxiv.2508.01495","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2508.01495","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"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":"pmh:oai:arXiv.org:2508.01495","is_oa":true,"landing_page_url":"https://arxiv.org/abs/2508.01495","pdf_url":"https://arxiv.org/pdf/2508.01495","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"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":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G3181469019","display_name":"Robust Multi-Robot Path Planning and Execution on a Large Scale","funder_award_id":"2328671","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G3936590927","display_name":"CAREER: Environment Optimization for Large-Scale Multi-Agent Coordination: Models, Methods, and Applications","funder_award_id":"2441629","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"Planning":[0],"collision-free":[1],"paths":[2],"for":[3,138],"a":[4,10,60,68,72,108,118],"large":[5],"group":[6],"of":[7,74],"agents":[8,40,142],"is":[9],"challenging":[11],"problem":[12],"in":[13,20,163],"many":[14],"real-world":[15,169],"applications.":[16],"While":[17],"recent":[18],"advances":[19],"Multi-Agent":[21],"Path":[22],"Finding":[23],"(MAPF)":[24],"have":[25],"shown":[26],"promising":[27],"progress,":[28],"standard":[29],"MAPF":[30,46,69,109,115,156],"planners":[31],"continue":[32],"to":[33,127,140,152],"rely":[34],"on":[35,101,168],"simplified":[36],"kinodynamic":[37,54],"models,":[38],"preventing":[39],"from":[41],"directly":[42],"following":[43],"the":[44],"generated":[45],"plan.":[47],"To":[48],"bridge":[49],"this":[50],"gap,":[51],"we":[52,103],"propose":[53,104],"Temporal":[55],"Plan":[56],"Graph":[57],"planning":[58],"(kTPG),":[59],"multi-agent":[61],"speed":[62,77,136],"optimization":[63],"algorithm":[64],"that":[65,112,132],"efficiently":[66],"refines":[67,114],"plan":[70],"into":[71],"set":[73],"kinodynamically":[75],"feasible":[76],"profiles.":[78],"We":[79,159],"further":[80,160],"incorporate":[81],"execution":[82,110,126,157],"timing":[83],"uncertainty":[84,92],"models":[85,93],"and":[86,94,146,167],"provide":[87],"deterministic":[88],"guarantees":[89,96],"under":[90,97],"bounded":[91],"probabilistic":[95],"stochastic":[98],"models.":[99],"Building":[100],"kTPG,":[102],"Windowed":[105],"kTPG":[106],"(WinkTPG),":[107],"framework":[111],"incrementally":[113],"plans":[116],"using":[117],"window-based":[119],"mechanism,":[120],"dynamically":[121],"incorporating":[122],"agent":[123],"information":[124],"during":[125],"reduce":[128],"uncertainty.":[129],"Experiments":[130],"show":[131],"WinkTPG":[133,162],"can":[134],"generate":[135],"profiles":[137],"up":[139,151],"1,000":[141],"within":[143],"1":[144],"second":[145],"improves":[147],"solution":[148],"quality":[149],"by":[150],"51.7%":[153],"over":[154],"existing":[155],"methods.":[158],"validate":[161],"high-fidelity":[164],"physics-based":[165],"simulation":[166],"robots.":[170]},"counts_by_year":[],"updated_date":"2026-07-15T18:14:33.161393","created_date":"2025-10-10T00:00:00"}