{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T20:37:07Z","timestamp":1725568627876},"publisher-location":"Berlin, Heidelberg","reference-count":25,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642169571"},{"type":"electronic","value":"9783642169588"}],"license":[{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-16958-8_10","type":"book-chapter","created":{"date-parts":[[2010,11,2]],"date-time":"2010-11-02T16:26:12Z","timestamp":1288715172000},"page":"94-105","source":"Crossref","is-referenced-by-count":4,"title":["Path Planning for Groups Using Column Generation"],"prefix":"10.1007","author":[{"given":"Marjan","family":"van den Akker","sequence":"first","affiliation":[]},{"given":"Roland","family":"Geraerts","sequence":"additional","affiliation":[]},{"given":"Han","family":"Hoogeveen","sequence":"additional","affiliation":[]},{"given":"Corien","family":"Prins","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"10_CR1","unstructured":"CPLEX 11.0. User\u2019s manual. Technical report, ILOG SA, Gentilly, France (2008)"},{"key":"10_CR2","unstructured":"Bayazit, O., Lien, J.-M., Amato, N.: Better group behaviors in complex environments using global roadmaps. Artificial Life, 362\u2013370 (2002)"},{"key":"10_CR3","volume-title":"Principles of Robot Motion: Theory, Algorithms, and Implementations","author":"H. Choset","year":"2005","unstructured":"Choset, H., Lynch, K., Hutchinson, S., Kantor, G., Burgard, W., Kavraki, L., Thrun, S.: Principles of Robot Motion: Theory, Algorithms, and Implementations, 1st edn. MIT Press, Cambridge (2005)","edition":"1"},{"key":"10_CR4","doi-asserted-by":"publisher","first-page":"419","DOI":"10.1287\/opre.6.3.419","volume":"6","author":"L. Ford Jr.","year":"1958","unstructured":"Ford Jr., L., Fulkerson, D.: Constructing maximal dynamic flows from static flows. Operations Research\u00a06, 419\u2013433 (1958)","journal-title":"Operations Research"},{"key":"10_CR5","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1287\/mnsc.5.1.97","volume":"5","author":"L. Ford Jr.","year":"1958","unstructured":"Ford Jr., L., Fulkerson, D.: A suggested computation for maximal multi-commodity network flows. Management Science\u00a05, 97\u2013101 (1958)","journal-title":"Management Science"},{"key":"10_CR6","doi-asserted-by":"crossref","unstructured":"Geraerts, R.: Planning short paths with clearance using explicit corridors. In: IEEE International Conference on Robotics and Automation, pp. 1997\u20132004 (2010)","DOI":"10.1109\/ROBOT.2010.5509263"},{"key":"10_CR7","doi-asserted-by":"crossref","unstructured":"Ghrist, R., O\u2019Kane, J., LaValle, S.: Pareto optimal coordination on roadmaps. In: International Workshop on the Algorithmic Foundations of Robotics, pp. 171\u2013186 (2004)","DOI":"10.1007\/10991541_13"},{"key":"10_CR8","doi-asserted-by":"publisher","first-page":"100","DOI":"10.1109\/TSSC.1968.300136","volume":"4","author":"P. Hart","year":"1968","unstructured":"Hart, P., Nilsson, N., Raphael, B.: A formal basis for the heuristic determination of minimum cost paths. IEEE Transactions on Systems Science and Cybernetics\u00a04, 100\u2013107 (1968)","journal-title":"IEEE Transactions on Systems Science and Cybernetics"},{"key":"10_CR9","doi-asserted-by":"crossref","unstructured":"Kamphuis, A., Overmars, M.: Finding paths for coherent groups using clearance. In: Eurographics\/ACM SIGGRAPH Symposium on Computer Animation, pp. 19\u201328 (2004)","DOI":"10.1145\/1028523.1028526"},{"key":"10_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1007\/978-3-642-10347-6_4","volume-title":"Motion in Games","author":"I. Karamouzas","year":"2009","unstructured":"Karamouzas, I., Heil, P., van Beek, P., Overmars, M.: A predictive collision avoidance model for pedestrian simulation. In: Egges, A. (ed.) MIG 2009. LNCS, vol.\u00a05884, pp. 41\u201352. Springer, Heidelberg (2009)"},{"key":"10_CR11","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4615-4022-9","volume-title":"Robot Motion Planning","author":"J.-C. Latombe","year":"1991","unstructured":"Latombe, J.-C.: Robot Motion Planning. Kluwer, Dordrecht (1991)"},{"key":"10_CR12","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511546877","volume-title":"Planning Algorithms","author":"S. LaValle","year":"2006","unstructured":"LaValle, S.: Planning Algorithms. Cambridge University Press, Cambridge (2006)"},{"key":"10_CR13","doi-asserted-by":"publisher","first-page":"912","DOI":"10.1109\/70.736775","volume":"14","author":"S. LaValle","year":"1998","unstructured":"LaValle, S., Hutchinson, S.: Optimal motion planning for multiple robots having independent goals. Transaction on Robotics and Automation\u00a014, 912\u2013925 (1998)","journal-title":"Transaction on Robotics and Automation"},{"key":"10_CR14","unstructured":"Li, Y.: Real-time motion planning of multiple agents and formations in virtual environments. PhD thesis, Simon Fraser University (2008)"},{"key":"10_CR15","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1177\/0278364905051974","volume":"24","author":"J. Peng","year":"2005","unstructured":"Peng, J., Akella, S.: Coordinating multiple robots with kinodynamic constraints along specified paths. International Journal of Robotics Research\u00a024, 295\u2013310 (2005)","journal-title":"International Journal of Robotics Research"},{"key":"10_CR16","volume-title":"AI Game Programming Wisdom 2","author":"S. Rabin","year":"2004","unstructured":"Rabin, S.: AI Game Programming Wisdom 2. Charles River Media Inc., Hingham (2004)"},{"key":"10_CR17","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1145\/37402.37406","volume":"21","author":"C. Reynolds","year":"1987","unstructured":"Reynolds, C.: Flocks, herds, and schools: A distributed behavioral model. Computer Graphics\u00a021, 25\u201334 (1987)","journal-title":"Computer Graphics"},{"key":"10_CR18","doi-asserted-by":"crossref","unstructured":"S\u00e1nchez, G., Latombe, J.-C.: Using a PRM planner to compare centralized and decoupled planning for multi-robot systems. In: IEEE International Conference on Robotics and Automation, pp. 2112\u20132119 (2002)","DOI":"10.1109\/ROBOT.2002.1014852"},{"key":"10_CR19","doi-asserted-by":"publisher","first-page":"46","DOI":"10.1177\/027836498300200304","volume":"2","author":"J. Schwartz","year":"1983","unstructured":"Schwartz, J., Sharir, M.: On the piano movers\u2019 problem: III. Coordinating the motion of several independent bodies: The special case of circular bodies moving amidst polygonal obstacles. International Journal of Robotics Research\u00a02, 46\u201375 (1983)","journal-title":"International Journal of Robotics Research"},{"key":"10_CR20","doi-asserted-by":"crossref","unstructured":"Silver, D.: Cooperative pathfinding. In: Artificial Intelligence for Interactive Digital Entertainment, pp. 117\u2013122 (2005)","DOI":"10.1609\/aiide.v1i1.18726"},{"key":"10_CR21","doi-asserted-by":"publisher","first-page":"42","DOI":"10.1109\/70.988973","volume":"18","author":"T. Sim\u00e9on","year":"2002","unstructured":"Sim\u00e9on, T., Leroy, S., Laumond, J.-P.: Path coordination for multiple mobile robots: A resolution complete algorithm. IEEE Transactions on Robotics and Automation\u00a018, 42\u201349 (2002)","journal-title":"IEEE Transactions on Robotics and Automation"},{"key":"10_CR22","doi-asserted-by":"crossref","unstructured":"van den Berg, J., Lin, M., Manocha, D.: Reciprocal velocity obstacles for real-time multi-agent navigation. In: IEEE International Conference on Robotics and Automation, pp. 1928\u20131935 (2008)","DOI":"10.1109\/ROBOT.2008.4543489"},{"key":"10_CR23","doi-asserted-by":"crossref","unstructured":"van den Berg, J., Overmars, M.: Prioritized motion planning for multiple robots. In: IEEE\/RSJ International Conference on Intelligent Robots and Systems, pp. 2217\u20132222 (2005)","DOI":"10.1109\/IROS.2005.1545306"},{"key":"10_CR24","doi-asserted-by":"publisher","first-page":"1602","DOI":"10.1287\/opre.19.7.1602","volume":"19","author":"W. Wilkinson","year":"1971","unstructured":"Wilkinson, W.: An algorithm for universal maximal dynamic flows in a network. Operations Research\u00a019, 1602\u20131612 (1971)","journal-title":"Operations Research"},{"key":"10_CR25","volume-title":"Integer Programming","author":"L. Wolsey","year":"1998","unstructured":"Wolsey, L.: Integer Programming. Wiley, New York (1998)"}],"container-title":["Lecture Notes in Computer Science","Motion in Games"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-16958-8_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,6,4]],"date-time":"2023-06-04T03:00:45Z","timestamp":1685847645000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-16958-8_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642169571","9783642169588"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-16958-8_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}