{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,18]],"date-time":"2025-09-18T21:06:49Z","timestamp":1758229609941,"version":"3.44.0"},"reference-count":0,"publisher":"Association for the Advancement of Artificial Intelligence (AAAI)","issue":"1","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["ICAPS"],"abstract":"<jats:p>This paper deals with the problem of planning multiple agent movements through a mission area modeled as a graph. The agents undergo classic communication and temporal constraints, and the quantitative objective is the minimization of the team\u2019s traversal makespan. Additional specificities make the problem a particularly complex routing one: on some nodes are associated durative and coordinated actions to perform, which can involve either the co-presence of several agents or time dependencies. Also, some agents are deployable and able to move on denser graphs: namely, aerial robots can take off and land on the ground vehicle at any planned position, and can fly above ground obstacles. We model the problem as a CSP and solve it with a network flow model. Results show the efficacy of the model and resolution scheme, which provides solutions with one or two orders of magnitude smaller time than a numerical temporal hierarchical planning model, with only a few percent loss of optimality.<\/jats:p>","DOI":"10.1609\/icaps.v35i1.36137","type":"journal-article","created":{"date-parts":[[2025,9,16]],"date-time":"2025-09-16T22:29:03Z","timestamp":1758061743000},"page":"348-357","source":"Crossref","is-referenced-by-count":0,"title":["A Flow Based Planning Method for Multi-Agent Progression with Deployable Agents and Communication Constraints"],"prefix":"10.1609","volume":"35","author":[{"given":"Emile","family":"Siboulet","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Roland","family":"Godet","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Arthur","family":"Bit-Monnot","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marc-Emmanuel Coupvent Des","family":"Graviers","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Christophe","family":"Guettier","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Simon","family":"Lacroix","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"9382","published-online":{"date-parts":[[2025,9,16]]},"container-title":["Proceedings of the International Conference on Automated Planning and Scheduling"],"original-title":[],"link":[{"URL":"https:\/\/ojs.aaai.org\/index.php\/ICAPS\/article\/download\/36137\/38291","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/ojs.aaai.org\/index.php\/ICAPS\/article\/download\/36137\/38291","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,9,16]],"date-time":"2025-09-16T22:29:04Z","timestamp":1758061744000},"score":1,"resource":{"primary":{"URL":"https:\/\/ojs.aaai.org\/index.php\/ICAPS\/article\/view\/36137"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,9,16]]},"references-count":0,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2025,9,16]]}},"URL":"https:\/\/doi.org\/10.1609\/icaps.v35i1.36137","relation":{},"ISSN":["2334-0843","2334-0835"],"issn-type":[{"type":"electronic","value":"2334-0843"},{"type":"print","value":"2334-0835"}],"subject":[],"published":{"date-parts":[[2025,9,16]]}}}