{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,4]],"date-time":"2025-09-04T13:54:56Z","timestamp":1756994096348},"reference-count":44,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2014,4,4]],"date-time":"2014-04-04T00:00:00Z","timestamp":1396569600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Auton Agent Multi-Agent Syst"],"published-print":{"date-parts":[[2015,5]]},"DOI":"10.1007\/s10458-014-9259-z","type":"journal-article","created":{"date-parts":[[2014,4,3]],"date-time":"2014-04-03T18:20:24Z","timestamp":1396549224000},"page":"335-363","source":"Crossref","is-referenced-by-count":3,"title":["An iterative approach for makespan-minimized multi-agent path planning in discrete space"],"prefix":"10.1007","volume":"29","author":[{"given":"Wenjie","family":"Wang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wooi Boon","family":"Goh","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2014,4,4]]},"reference":[{"issue":"3","key":"9259_CR1","doi-asserted-by":"crossref","first-page":"455","DOI":"10.1007\/BF00939377","volume":"76","author":"JL Zhou","year":"1993","unstructured":"Zhou, J. L., & Tits, A. L. (1993). Nonmonotone line search for minimax problems. Journal of Optimization Theory and Applications, 76(3), 455\u2013476.","journal-title":"Journal of Optimization Theory and Applications"},{"issue":"2","key":"9259_CR2","doi-asserted-by":"crossref","first-page":"581","DOI":"10.1016\/j.amc.2007.10.070","volume":"199","author":"F Ye","year":"2008","unstructured":"Ye, F., Liu, H., Zhou, S., & Liu, S. (2008). A smoothing trust-region Newton-CG method for minimax problem. Journal of Applied Mathematics and Computation, 199(2), 581\u2013589.","journal-title":"Journal of Applied Mathematics and Computation"},{"issue":"13","key":"9259_CR3","doi-asserted-by":"crossref","first-page":"6296","DOI":"10.1016\/j.amc.2011.01.002","volume":"217","author":"F Wang","year":"2011","unstructured":"Wang, F., & Wang, Y. (2011). Nonmonotone algorithm for minimax optimization problems. Applied Mathematics and Computation, 217(13), 6296\u20136308.","journal-title":"Applied Mathematics and Computation"},{"issue":"3","key":"9259_CR4","doi-asserted-by":"crossref","first-page":"407","DOI":"10.1007\/BF00940683","volume":"69","author":"E Polak","year":"1991","unstructured":"Polak, E., Mayne, D. Q., & Higgins, J. E. (1991). Superlinearly convergent algorithm for min-max problems. Journal of Optimization Theory and Applications, 69(3), 407\u2013439.","journal-title":"Journal of Optimization Theory and Applications"},{"key":"9259_CR5","doi-asserted-by":"crossref","first-page":"2750","DOI":"10.1016\/j.amc.2011.08.017","volume":"218","author":"J Li","year":"2011","unstructured":"Li, J., & Huo, J. (2011). Inexact smoothing method for large scale minimax optimization. Journal of Applied Mathematics and Computation, 218, 2750\u20132760.","journal-title":"Journal of Applied Mathematics and Computation"},{"key":"9259_CR6","doi-asserted-by":"crossref","first-page":"4567","DOI":"10.1016\/j.amc.2011.10.039","volume":"218","author":"S He","year":"2011","unstructured":"He, S., & Zhou, S. (2011). A nonlinear augmented lagrangian for constrained minimax problems. Journal of Applied Mathematics and Computation, 218, 4567\u20134579.","journal-title":"Journal of Applied Mathematics and Computation"},{"issue":"4","key":"9259_CR7","first-page":"76","volume":"3","author":"JE Hopcroft","year":"1984","unstructured":"Hopcroft, J. E., Schwartz, J. T., & Sharir, M. (1984). On the complexity of motion planning for multiple independent objects; PSPACE-hardness of the Warehouseman\u2019s problem. IJRR, 3(4), 76\u201388.","journal-title":"IJRR"},{"key":"9259_CR8","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1016\/S0747-7171(08)80001-6","volume":"10","author":"D Ratner","year":"1990","unstructured":"Ratner, D., & Warmuth, M. (1990). The ( $$n^2$$ n 2 -1)-puzzle and related relocation problems. Journal of Symbolic Computation, 10, 111\u2013137.","journal-title":"Journal of Symbolic Computation"},{"issue":"3","key":"9259_CR9","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1016\/S0921-8890(97)00033-X","volume":"23","author":"P Svestka","year":"1998","unstructured":"Svestka, P., & Overmars, M. H. (1998). Coordinated path planning for multiple robots. Robotics and Autonomous Systems, 23(3), 125\u2013152.","journal-title":"Robotics and Autonomous Systems"},{"key":"9259_CR10","unstructured":"Mors, A. T., Witteveen, C., Zutt, J. & Kuipers, F. A. (2010). Context-aware route planning. In 8th German Conference, MATES 2010, Leipzig, Germany (pp. 138\u2013149)."},{"key":"9259_CR11","unstructured":"van den Berg, J., Snoeyink, J., Lin, M. & Manocha, D. (2009). Centralized path planning for multiple agents: Optimal decoupling into sequential plans. In Proceedings of Agentics: Science and Systems, Seattle, USA."},{"key":"9259_CR12","unstructured":"Wang, W. & Goh, W. B. (2011). Spatio-temporal A* algorithms for offline multiple mobile robot path planning. In Proceedings of 10th International Conference on Autonomous Agents and Multi-Agent Systems (pp. 1091\u20131092)."},{"key":"9259_CR13","doi-asserted-by":"crossref","unstructured":"Bennewitz, M., Burgard, W., & Thrun, S. (2001). Optimizing schedules for prioritized path planning of multi-robot systems. In Proceedings of IEEE International Conference on Robotics and Automation (vol.1, pp. 271\u2013276).","DOI":"10.1109\/ROBOT.2001.932565"},{"key":"9259_CR14","unstructured":"Silver, D. (2005). Cooperative pathfinding. In Proceedings of AIIDE (pp. 117\u2013122)."},{"key":"9259_CR15","unstructured":"Sturtevant, N. & Buro, M. (2006). Improving collaborative pathfinding using map abstraction. In Proceedings of the Second Artificial Intelligence and Interactive Digital Entertainment Conference (pp. 80\u201385)."},{"key":"9259_CR16","unstructured":"R\u00f8ger, G. & Helmert, M. (2012). Non-optimal multi-agent pathfinding is solved (since 1984). In Proceedings of the Fifth Annual Symposium on Combinatorial Search (pp. 173\u2013174)."},{"key":"9259_CR17","unstructured":"Ryan, M. (2006). Multi-robot path planning with subgraphs. In Proceedings of the 19th Australasian Conference Robotics and Automation."},{"key":"9259_CR18","unstructured":"Ryan, M. (2007). Graph decomposition for efficient multi-robot path planning. In Proceedings of the 20th International Joint Conference on Artificial Intelligence (pp. 2003\u20132008)."},{"key":"9259_CR19","unstructured":"Wang, K.-H. C. & Botea, A. (2008). Fast and memory-efficient multi-agent pathfinding. In Proceedings of the Eighteenth International Conference on Automated Planning and Scheduling."},{"key":"9259_CR20","unstructured":"Wang, K.-H. C. & Botea, A. (2009). Tractable multi-agent path planning on grid maps. In Proceedings of the International Joint Conference on Artificial Intelligence."},{"key":"9259_CR21","first-page":"55","volume":"42","author":"K-HC Wang","year":"2011","unstructured":"Wang, K.-H. C., & Botea, A. (2011). MAPP: A scalable multi-agent path planning algorithm with tractability and completeness guarantees. Journal of Artificial Intelligence Research, 42, 55\u201390.","journal-title":"Journal of Artificial Intelligence Research"},{"key":"9259_CR22","doi-asserted-by":"crossref","unstructured":"Peasgood, M., Clark, C.M. & McPhee, J. (2008). A complete and scalable strategy for coordinating multiple agents within roadmaps. In IEEE Transaction on Agentics (vol. 24, no. 2).","DOI":"10.1109\/TRO.2008.918056"},{"key":"9259_CR23","unstructured":"Masehian, E. & Nejad, A. H. (2009). Solvability of multi agent motion planning problems on trees. In IEEE International Conference on Intelligent Agents and Systems."},{"key":"9259_CR24","unstructured":"Khorshid, M. M., Holte, R. C. & Sturtevant, N. (2011). A polynomial-time algorithm for non-optimal multi-agent pathfinding. In Proceedings of the Fourth International Symposium on Combinatorial Search."},{"key":"9259_CR25","doi-asserted-by":"crossref","unstructured":"Surynek, P. (2009). A novel approach to path planning for multiple robots in bi-connected graphs. In IEEE International Conference on Robotics and Automation (pp. 3613\u20133619).","DOI":"10.1109\/ROBOT.2009.5152326"},{"key":"9259_CR26","doi-asserted-by":"crossref","unstructured":"Surynek, P. (2009). An application of pebble motion on graphs to abstract multi-robot path planning. In IEEE International Conference on Tools with Artificial Intelligence (pp. 151\u2013158).","DOI":"10.1109\/ICTAI.2009.62"},{"key":"9259_CR27","unstructured":"Luna, R. & Bekris, K. E. (2011). Push and swap: Fast cooperative path-finding with completeness guarantees. In Proceedings of the Twenty-Second International Joint Conference on Artificial Intelligence (pp. 294\u2013300)."},{"key":"9259_CR28","unstructured":"Sajid, Q., Luna, R. & Bekris, K. E. (2012). Multi-agent pathfinding with simultaneous execution of single-agent primitives. In Proceedings of Fifth Symposium on Combinatorial Search."},{"key":"9259_CR29","unstructured":"Krontiris, A., Luna, R. & Bekris, K. E. (2013). From feasibility tests to path planners for multi-agent pathfinding. In Symposium on Combinatorial Search."},{"key":"9259_CR30","unstructured":"Ratner, D. & Warmuth, M. K. (1986). Finding a shortest solution for the N N extension of the 15-PUZZLE is intractable. In National Conference on Artificial Intelligence."},{"key":"9259_CR31","unstructured":"Wilde, B. D. (2012). Cooperative multi-agent path planning. Master Thesis, Delft University of Technology."},{"key":"9259_CR32","doi-asserted-by":"crossref","unstructured":"Standley, T. (2010). Finding optimal solutions to cooperative pathfinding problems. In Proceedings of the Twenty-Fourth AAAI Conference on Artificial Intelligence (pp. 173\u2013178).","DOI":"10.1609\/aaai.v24i1.7564"},{"key":"9259_CR33","unstructured":"Standley, T. & Korf, R. (2011). Complete algorithms for cooperative pathfinding problems. In Proceedings of the 22nd International Joint Conference on Artificial Intelligence (pp. 668\u2013673)."},{"key":"9259_CR34","doi-asserted-by":"crossref","unstructured":"Wagner, G. & Choset, H. (2011). M*: A complete multirobot path planning algorithm with performance bounds. In 2011 IEEE\/RSJ International Conference on Intelligent Robots and Systems (pp. 3260\u20133267).","DOI":"10.1109\/IROS.2011.6095022"},{"key":"9259_CR35","unstructured":"Sharon, G., Stern, R., Goldenberg, M., & Felner, A. (2011). The increasing cost tree search for optimal multi-agent pathfinding. In Proceedings of the Twenty-Second International Joint Conference on Artificial Intelligence (vol. 1, pp. 662\u2013667)."},{"key":"9259_CR36","unstructured":"Sharon, G., Stern, R., Felner, A. & Sturtevant, N. (2012). Conflict-based search for optimal multi-agent path finding. In Proceedings of the Twenty-Sixth AAAI Conference on Artificial Intelligence."},{"key":"9259_CR37","doi-asserted-by":"crossref","unstructured":"Yu, J. & LaValle, S. M. (2013). Planning optimal paths for multiple robots on graphs. In 2013 IEEE International Conference on Robotics and Automation.","DOI":"10.1109\/ICRA.2013.6631084"},{"key":"9259_CR38","unstructured":"Geramifard, A., Chubak, P. & Bulitko, V. (2006). Biased cost pathfinding. In Proceedings of AIIDE (pp. 112\u2013114)."},{"key":"9259_CR39","doi-asserted-by":"crossref","first-page":"34","DOI":"10.1007\/0-387-22742-3_3","volume-title":"Numerical optimization","author":"J Nocedal","year":"1999","unstructured":"Nocedal, J., & Wright, S. J. (1999). Line search methods. In J. Nocedal & S. J. Wright (Eds.), Numerical optimization (2nd ed., pp. 34\u201363). New York: Springer.","edition":"2"},{"key":"9259_CR40","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1017\/CBO9780511804441.006","volume-title":"Convex Optimization","author":"S Boyd","year":"2004","unstructured":"Boyd, S., & Vandenberghe, L. (2004). Duality (chapter 5). In S. Boyd & L. Vandenberghe (Eds.), Convex Optimization (pp. 215\u2013273). Cambridge: Cambridge University Press."},{"key":"9259_CR41","doi-asserted-by":"crossref","unstructured":"Vanderbei, R. J. (2008). Simplex method (chapter 2). In R. J. Vanderbei (Ed.), Linear programming: Foundations and extensions (3rd ed., pp. 13\u201327). Boston: Springer.","DOI":"10.1007\/978-0-387-74388-2_2"},{"key":"9259_CR42","doi-asserted-by":"crossref","first-page":"599","DOI":"10.1007\/978-1-4419-1665-5_20","volume-title":"Handbook of metaheuristics","author":"J-P Watson","year":"2010","unstructured":"Watson, J.-P. (2010). An introduction to fitness landscape analysis and cost models for local search. In M. Gendreau & J.-Y. Potvin (Eds.), Handbook of metaheuristics (pp. 599\u2013623). Boston: Springer."},{"key":"9259_CR43","unstructured":"Voudouris, C. (1997). Guided Local Search for combinatorial optimisation problems. Ph.D. thesis, Department of Computer Science, University of Essex."},{"key":"9259_CR44","unstructured":"Yu, J., & LaValle, S. M. (2013). Planning optimal paths for multiple robots on graphs. Retrieved from http:\/\/msl.cs.uiuc.edu\/jyu18\/_mapp.html . Accessed 15 Nov 2013."}],"container-title":["Autonomous Agents and Multi-Agent Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10458-014-9259-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10458-014-9259-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10458-014-9259-z","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,7,11]],"date-time":"2023-07-11T19:46:24Z","timestamp":1689104784000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10458-014-9259-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,4,4]]},"references-count":44,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2015,5]]}},"alternative-id":["9259"],"URL":"https:\/\/doi.org\/10.1007\/s10458-014-9259-z","relation":{},"ISSN":["1387-2532","1573-7454"],"issn-type":[{"value":"1387-2532","type":"print"},{"value":"1573-7454","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,4,4]]}}}