@article{MarcondosSantos2020c,
  abstract = {Agents can individually devise plans and coordinate to achieve common goals. Methods exist to factor planning problems into separate tasks and distribute the plan synthesis process, while reducing the overall planning complexity. However, merging distributedly generated plans becomes computationally costly when task plans are tightly coupled, and conflicts arise due to dependencies between plan actions. Existing methods either scale poorly as the number of agents and tasks increases, or do not minimize makespan, the overall time necessary to execute all tasks. A new family of plan coordination and conflict resolution algorithms is introduced to merge independently generated plans, minimize the resulting makespan, and scale to a large number of tasks and agents in complex problems. A thorough algorithmic analysis and empirical evaluation demonstrates how the new conflict identification and resolution models can impact the resulting plan quality and computational cost across two heterogeneous multiagent domains and outperform the baseline algorithms. },
  added-at = {2020-05-24T20:36:48.000+0200},
  author = {Marcon dos Santos, Gilberto and Adams, Julie A.},
  biburl = {https://www.bibsonomy.org/bibtex/2907f8c7d42a23f90c5345fe0a9f2f39f/marcondg},
  interhash = {773af77bb3fe68fa669772dbf013b5e5},
  intrahash = {907f8c7d42a23f90c5345fe0a9f2f39f},
  keywords = {mine},
  timestamp = {2020-05-24T20:36:48.000+0200},
  title = {Scalable Temporal Plan Merging},
  year = {in review}
}

{"_id":"tqXkdjmyQXiBbh63G","bibbaseid":"marcondossantos-adams-scalabletemporalplanmerging-inreview","author_short":["Marcon dos Santos, G.","Adams, J. A."],"bibdata":{"bibtype":"article","type":"article","abstract":"Agents can individually devise plans and coordinate to achieve common goals. Methods exist to factor planning problems into separate tasks and distribute the plan synthesis process, while reducing the overall planning complexity. However, merging distributedly generated plans becomes computationally costly when task plans are tightly coupled, and conflicts arise due to dependencies between plan actions. Existing methods either scale poorly as the number of agents and tasks increases, or do not minimize makespan, the overall time necessary to execute all tasks. A new family of plan coordination and conflict resolution algorithms is introduced to merge independently generated plans, minimize the resulting makespan, and scale to a large number of tasks and agents in complex problems. A thorough algorithmic analysis and empirical evaluation demonstrates how the new conflict identification and resolution models can impact the resulting plan quality and computational cost across two heterogeneous multiagent domains and outperform the baseline algorithms. ","added-at":"2020-05-24T20:36:48.000+0200","author":[{"propositions":["Marcon","dos"],"lastnames":["Santos"],"firstnames":["Gilberto"],"suffixes":[]},{"propositions":[],"lastnames":["Adams"],"firstnames":["Julie","A."],"suffixes":[]}],"biburl":"https://www.bibsonomy.org/bibtex/2907f8c7d42a23f90c5345fe0a9f2f39f/marcondg","interhash":"773af77bb3fe68fa669772dbf013b5e5","intrahash":"907f8c7d42a23f90c5345fe0a9f2f39f","keywords":"mine","timestamp":"2020-05-24T20:36:48.000+0200","title":"Scalable Temporal Plan Merging","year":"in review","bibtex":"@article{MarcondosSantos2020c,\n abstract = {Agents can individually devise plans and coordinate to achieve common goals. Methods exist to factor planning problems into separate tasks and distribute the plan synthesis process, while reducing the overall planning complexity. However, merging distributedly generated plans becomes computationally costly when task plans are tightly coupled, and conflicts arise due to dependencies between plan actions. Existing methods either scale poorly as the number of agents and tasks increases, or do not minimize makespan, the overall time necessary to execute all tasks. A new family of plan coordination and conflict resolution algorithms is introduced to merge independently generated plans, minimize the resulting makespan, and scale to a large number of tasks and agents in complex problems. A thorough algorithmic analysis and empirical evaluation demonstrates how the new conflict identification and resolution models can impact the resulting plan quality and computational cost across two heterogeneous multiagent domains and outperform the baseline algorithms. },\n added-at = {2020-05-24T20:36:48.000+0200},\n author = {Marcon dos Santos, Gilberto and Adams, Julie A.},\n biburl = {https://www.bibsonomy.org/bibtex/2907f8c7d42a23f90c5345fe0a9f2f39f/marcondg},\n interhash = {773af77bb3fe68fa669772dbf013b5e5},\n intrahash = {907f8c7d42a23f90c5345fe0a9f2f39f},\n keywords = {mine},\n timestamp = {2020-05-24T20:36:48.000+0200},\n title = {Scalable Temporal Plan Merging},\n year = {in review}\n}\n\n","author_short":["Marcon dos Santos, G.","Adams, J. A."],"key":"MarcondosSantos2020c","id":"MarcondosSantos2020c","bibbaseid":"marcondossantos-adams-scalabletemporalplanmerging-inreview","role":"author","urls":{},"keyword":["mine"],"metadata":{"authorlinks":{}},"html":""},"bibtype":"article","biburl":"gilbertomarcon.com/bib/bib.bib","dataSources":["EnSTqyuZDQaHMJc2b","oD7FHzhaHxPuTH44c"],"keywords":["mine"],"search_terms":["scalable","temporal","plan","merging","marcon dos santos","adams"],"title":"Scalable Temporal Plan Merging","year":null}