{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T07:25:04Z","timestamp":1740122704720,"version":"3.37.3"},"reference-count":40,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2019,5,28]],"date-time":"2019-05-28T00:00:00Z","timestamp":1559001600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2019,5,28]],"date-time":"2019-05-28T00:00:00Z","timestamp":1559001600000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Discrete Event Dyn Syst"],"published-print":{"date-parts":[[2019,6]]},"DOI":"10.1007\/s10626-019-00284-y","type":"journal-article","created":{"date-parts":[[2019,5,28]],"date-time":"2019-05-28T08:05:26Z","timestamp":1559030726000},"page":"211-235","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Efficient generation of performance bounds for a class of traffic scheduling problems"],"prefix":"10.1007","volume":"29","author":[{"given":"Greyson","family":"Daugherty","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6176-0925","authenticated-orcid":false,"given":"Spyros","family":"Reveliotis","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Greg","family":"Mohler","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,5,28]]},"reference":[{"key":"284_CR1","volume-title":"Network flows: theory, algorithms and applications","author":"RK Ahuja","year":"1993","unstructured":"Ahuja RK, Magnanti TL, Orlin JB (1993) Network flows: theory, algorithms and applications. Prentice Hall, Englewood Cliffs"},{"key":"284_CR2","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1007\/PL00009259","volume":"23","author":"V Auletta","year":"1999","unstructured":"Auletta V, Monti A, Parente M, Persiano P (1999) A linear-time algorithm for the feasibility of pebble motion on trees. Algorithmica 23:223\u2013245","journal-title":"Algorithmica"},{"key":"284_CR3","volume-title":"Nonlinear programming","author":"DP Bertsekas","year":"1999","unstructured":"Bertsekas DP (1999) Nonlinear programming, 2nd edn. Belmont, Athena Scientific","edition":"2nd edn."},{"key":"284_CR4","doi-asserted-by":"publisher","DOI":"10.1007\/978-0-387-68612-7","volume-title":"Introduction to discrete event systems","author":"CG Cassandras","year":"2008","unstructured":"Cassandras CG, Lafortune S (2008) Introduction to discrete event systems, 2nd edn. Springer, New York","edition":"2nd edn."},{"key":"284_CR5","doi-asserted-by":"crossref","unstructured":"Daugherty G (2017) Multi-agent routing in shared guidepath networks. PhD thesis, Georgia Tech, Atlanta, GA","DOI":"10.1109\/SOLI.2017.8120972"},{"issue":"1","key":"284_CR6","doi-asserted-by":"publisher","first-page":"363","DOI":"10.1109\/TASE.2018.2798630","volume":"16","author":"G Daugherty","year":"2019","unstructured":"Daugherty G, Reveliotis S, Mohler G (2019) Optimized multi-agent routing for a class of guidepath-based transport systems. IEEE Trans Autom Sci Eng 16(1):363\u2013381","journal-title":"IEEE Trans Autom Sci Eng"},{"key":"284_CR7","doi-asserted-by":"crossref","unstructured":"Daugherty G, Reveliotis S, Mohler G (2016) Some novel traffic coordination problems and their analytical study based on Lagrangian duality theory. In: Proceedings of the 55th IEEE conference on decision and control (CDC 2016), pages \u2013. IEEE","DOI":"10.1109\/CDC.2016.7798510"},{"key":"284_CR8","doi-asserted-by":"crossref","unstructured":"Daugherty G, Reveliotis S, Mohler G (2017) Optimized multi-agent routing in guidepath networks. In: Proceedings of the 2017 IFAC world congress, pages \u2013. IFAC","DOI":"10.1109\/SOLI.2017.8120972"},{"key":"284_CR9","doi-asserted-by":"crossref","unstructured":"Daugherty G, Reveliotis S, Mohler G (2017) Solving the Lagrangian dual problem for some traffic coordination problems through linear programming. In: Proceedings of the 56th IEEE conference on decision and control (CDC 2017), pages \u2013. IEEE","DOI":"10.1109\/CDC.2017.8264513"},{"key":"284_CR10","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1023\/B:FLEX.0000036032.41757.3d","volume":"15","author":"G Desaulniers","year":"2003","unstructured":"Desaulniers G, Langevin A, Riopel D, Villeneuve B (2003) Dispatching and conflict-free routing of automated guided vehicles: an exact approach. The Intl Jrnl of Flexible Manufacturing Systems 15:309\u2013331","journal-title":"The Intl Jrnl of Flexible Manufacturing Systems"},{"key":"284_CR11","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1287\/mnsc.27.1.1","volume":"27","author":"ML Fisher","year":"1981","unstructured":"Fisher ML (1981) The Lagrangian relaxation method for solving integer programming problems. Manag Sci 27:1\u201318","journal-title":"Manag Sci"},{"key":"284_CR12","doi-asserted-by":"publisher","first-page":"82","DOI":"10.1007\/BFb0120690","volume":"2","author":"AM Geoffrion","year":"1974","unstructured":"Geoffrion AM (1974) Lagrangian relaxation for integer programming. Math Programming Studies 2:82\u2013114","journal-title":"Math Programming Studies"},{"key":"284_CR13","doi-asserted-by":"crossref","DOI":"10.1201\/9781420066272","volume-title":"Facilities Design","author":"SS Heragu","year":"2008","unstructured":"Heragu SS (2008) Facilities Design, 3rd edn. CRC Press, Boca Raton","edition":"3rd edn."},{"key":"284_CR14","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1109\/70.210791","volume":"9","author":"DJ Hoitomt","year":"1993","unstructured":"Hoitomt DJ, Luh PB, Pattipati KR (1993) A practical approach to job-shop scheduling problems. IEEE Trans Rob Autom 9:1\u201313","journal-title":"IEEE Trans Rob Autom"},{"key":"284_CR15","doi-asserted-by":"crossref","first-page":"315","DOI":"10.1115\/1.2901666","volume":"115","author":"J Huang","year":"1993","unstructured":"Huang J, Palekar US, Kapoor SG (1993) A labeling algorithm for the navigation of automated guided vehicles. J Eng Ind 115:315\u2013321","journal-title":"J Eng Ind"},{"key":"284_CR16","doi-asserted-by":"crossref","unstructured":"Kornhauser D, Miller G, Spirakis P (1984) Coordinating pebble motion on graphs, the diameter of permutation groups, and applications. In: Proceedings of the IEEE Symp Found Comput Sci, IEEE, pp 241\u2013250","DOI":"10.1109\/SFCS.1984.715921"},{"key":"284_CR17","volume-title":"Model predictive control: classical, robust and stochastic","author":"B Kouvaritakis","year":"2015","unstructured":"Kouvaritakis B, Cannon M (2015) Model predictive control: classical, robust and stochastic. Springer, London"},{"key":"284_CR18","doi-asserted-by":"publisher","first-page":"1077","DOI":"10.1287\/opre.41.6.1077","volume":"41","author":"NN Krishnamurthy","year":"1993","unstructured":"Krishnamurthy NN, Batta R, Karwan MH (1993) Developing conflict-free routes for automated guided vehicles. Oper Res 41:1077\u20131090","journal-title":"Oper Res"},{"key":"284_CR19","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-18842-3","volume-title":"Linear and nonlinear programming","author":"DG Luenberger","year":"2016","unstructured":"Luenberger DG, Ye Y (2016) Linear and nonlinear programming, 4th edn. Springer, New York","edition":"4th edn."},{"key":"284_CR20","doi-asserted-by":"crossref","unstructured":"Ma H, Tovey C, Sharon G, Kumar S, Koenig S (2016) Multi-agent path finding with payload transfers and the package-exchange robot-routing problem. In: AAAI 2016, pp 3166\u20133173","DOI":"10.1609\/aaai.v30i1.10409"},{"key":"284_CR21","volume-title":"Heuristic scheduling systems","author":"TE Morton","year":"1993","unstructured":"Morton TE, Pentico D (1993) Heuristic scheduling systems. Wiley, New York"},{"key":"284_CR22","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511976667","volume-title":"Quantum computation and quantum information","author":"MA Nielsen","year":"2010","unstructured":"Nielsen MA, Chuang IL (2010) Quantum computation and quantum information. Cambridge University Press, Cambridge"},{"key":"284_CR23","doi-asserted-by":"publisher","first-page":"523","DOI":"10.1109\/TASE.2010.2043096","volume":"7","author":"T Nishi","year":"2010","unstructured":"Nishi T, Maeno R (2010) Petri net decomposition approach to optimization of route planning problem for AGV systems. IEEE Trans Autom Sci Eng 7:523\u2013537","journal-title":"IEEE Trans Autom Sci Eng"},{"key":"284_CR24","volume-title":"Combinatorial optimization: algorithms and complexity","author":"CH Papadimitriou","year":"1998","unstructured":"Papadimitriou CH, Steiglitz K (1998) Combinatorial optimization: algorithms and complexity. Mineola, Dover"},{"key":"284_CR25","volume-title":"Scheduling","author":"M Pinedo","year":"2002","unstructured":"Pinedo M (2002) Scheduling. Prentice Hall, Upper Saddle River"},{"key":"284_CR26","doi-asserted-by":"crossref","unstructured":"Reveliotis S (2018) Preservation of traffic liveness in MPC schemes for guidepath-based transport systems. In: Proceedings of IEEE CASE 2018, pages \u2013. IEEE","DOI":"10.1109\/COASE.2018.8560478"},{"key":"284_CR27","doi-asserted-by":"publisher","first-page":"1646","DOI":"10.1109\/TAC.2010.2046111","volume":"55","author":"S Reveliotis","year":"2010","unstructured":"Reveliotis S, Roszkowska E (2010) On the complexity of maximally permissive deadlock avoidance in multi-vehicle traffic systems. IEEE Trans Autom Control 55:1646\u20131651","journal-title":"IEEE Trans Autom Control"},{"issue":"7","key":"284_CR28","first-page":"647","volume":"32","author":"SA Reveliotis","year":"2000","unstructured":"Reveliotis SA (2000) Conflict resolution in AGV systems. IIE Trans 32(7):647\u2013659","journal-title":"IIE Trans"},{"key":"284_CR29","unstructured":"Sajid Q, Luna R, Bekris KE (2012) Multi-agent path finding with simultaneous execution of single-agent primitives. In: 5th symposium on combinatorial search"},{"key":"284_CR30","doi-asserted-by":"publisher","first-page":"40","DOI":"10.1016\/j.artint.2014.11.006","volume":"219","author":"G Sharon","year":"2015","unstructured":"Sharon G, Stern R, Felner A, Sturtevant NR (2015) Conflict-based search for optimal multi-agent pathfinding. Artif Intell 219:40\u201366","journal-title":"Artif Intell"},{"key":"284_CR31","doi-asserted-by":"crossref","unstructured":"Standley T (2010) Finding optimal solutions to cooperative pathfinding problems. In: Proceedings of the AAAI 2010","DOI":"10.1609\/aaai.v24i1.7564"},{"key":"284_CR32","unstructured":"Standley T, Korf R (2011) Complete algorithms for cooperative pathfinding problems. In: Proceedings of the 22nd international joint conference artificial intelligence"},{"key":"284_CR33","first-page":"564","volume-title":"Lecture Notes in Computer Science","author":"Pavel Surynek","year":"2012","unstructured":"Surynek P (2012) Towards optimal cooperative path planning in hard setups through satisfiability solving. In: Proceedings of the 12th pacific rim international conference artificial intelligence, pp 564\u2013576"},{"key":"284_CR34","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.artint.2014.11.001","volume":"219","author":"G Wagner","year":"2015","unstructured":"Wagner G, Choset H (2015) Subdimensional expansion for multirobot path planning. Artif Intell 219:1\u201324","journal-title":"Artif Intell"},{"key":"284_CR35","first-page":"55","volume":"42","author":"K-HC Wang","year":"2011","unstructured":"Wang K-HC, Botea A (2011) MAPP: A scalable multi-agent path planning algorithm with tractability and completeness guarantees. J Artif Intell Res 42:55\u201390","journal-title":"J Artif Intell Res"},{"key":"284_CR36","doi-asserted-by":"publisher","first-page":"86","DOI":"10.1016\/0095-8956(74)90098-7","volume":"16","author":"RM Wilson","year":"1974","unstructured":"Wilson RM (1974) Graph puzzles, homotopy, and the alternating group. Journal of Combinatorial Theory, B 16:86\u201396","journal-title":"Journal of Combinatorial Theory, B"},{"key":"284_CR37","volume-title":"Integer Programming","author":"LA Wolsey","year":"1998","unstructured":"Wolsey LA (1998) Integer Programming. Wiley, New York"},{"key":"284_CR38","unstructured":"Yu J, LaValle SM (2015) Optimal multi-robot path planning on graphs: structure and computational complexity. arXiv: 1507.03289v1"},{"key":"284_CR39","doi-asserted-by":"publisher","first-page":"1163","DOI":"10.1109\/TRO.2016.2593448","volume":"32","author":"J Yu","year":"2016","unstructured":"Yu J, LaValle SM (2016) Optimal multirobot path planning on graphs: complete algorithms and effective heuristics. IEEE Trans Robot 32:1163\u20131177","journal-title":"IEEE Trans Robot"},{"key":"284_CR40","doi-asserted-by":"crossref","unstructured":"Yu J, Rus D (2015) Pebble motion on graphs with rotations: efficient feasibility tests and planning algorithms. In: Algorithmic foundations of robotics XI","DOI":"10.1007\/978-3-319-16595-0_42"}],"container-title":["Discrete Event Dynamic Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10626-019-00284-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10626-019-00284-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10626-019-00284-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,9,18]],"date-time":"2022-09-18T18:55:25Z","timestamp":1663527325000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10626-019-00284-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,5,28]]},"references-count":40,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2019,6]]}},"alternative-id":["284"],"URL":"https:\/\/doi.org\/10.1007\/s10626-019-00284-y","relation":{},"ISSN":["0924-6703","1573-7594"],"issn-type":[{"type":"print","value":"0924-6703"},{"type":"electronic","value":"1573-7594"}],"subject":[],"published":{"date-parts":[[2019,5,28]]},"assertion":[{"value":"26 July 2018","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"21 May 2019","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"28 May 2019","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}