{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,9,13]],"date-time":"2023-09-13T18:17:25Z","timestamp":1694629045586},"reference-count":31,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2006,11,3]],"date-time":"2006-11-03T00:00:00Z","timestamp":1162512000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2006,11,3]],"date-time":"2006-11-03T00:00:00Z","timestamp":1162512000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Auton Agent Multi-Agent Syst"],"published-print":{"date-parts":[[2007,6]]},"DOI":"10.1007\/s10458-006-9006-1","type":"journal-article","created":{"date-parts":[[2006,11,3]],"date-time":"2006-11-03T01:48:56Z","timestamp":1162518536000},"page":"211-237","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Searching for close alternative plans"],"prefix":"10.1007","volume":"14","author":[{"given":"Ariel","family":"Felner","sequence":"first","affiliation":[]},{"given":"Roni","family":"Stern","sequence":"additional","affiliation":[]},{"given":"Jeffrey S.","family":"Rosenschein","sequence":"additional","affiliation":[]},{"given":"Alex","family":"Pomeransky","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2006,11,3]]},"reference":[{"key":"9006_CR1","unstructured":"Ambros-Ingerson, J., & Steel, S. (1998). Integrating planning, execution and monitoring. In Proceedings of AAAI-88 (pp. 735\u2013740). St. Paul, Minnesota."},{"key":"9006_CR2","doi-asserted-by":"crossref","unstructured":"Arkin, E., Chew, L. P., Huttenlovher, D. P., Kedem, K., & Mitcjell, J. S. B. (1990). An efficiently computable metric for comparing polygonal shapes. In Proceedings of the first ACM-SIAM Symposium on Discrete Algorithms (pp. 209\u2013216).","DOI":"10.21236\/ADA235508"},{"key":"9006_CR3","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1016\/0020-0190(83)90042-X","volume":"17","author":"M.J. Atallah","year":"1983","unstructured":"Atallah M.J. (1983). A linear time algorithm for the Hausdorff distance between convex polygons. Information Processing Letters 17, 207\u2013209","journal-title":"Information Processing Letters"},{"key":"9006_CR4","unstructured":"Barber, C. B., Dobkin, D. P., & Huhdanpaa, H. (1993). The Quickhull algorithm for convex hull. Geometry Center Technical Report GCG53, University of Minnesota."},{"key":"9006_CR5","unstructured":"Brock, O., & Oussama, K. (2000). Real-time replanning in high-dimensional configuration spaces using sets of homotopic paths. In Proceedings of the IEEE international conference on robotics and automation (pp. 550\u2013555) San Francisco, USA."},{"issue":"3","key":"9006_CR6","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1007\/BF01384247","volume":"2","author":"E. Ephrati","year":"1993","unstructured":"Ephrati E., Rosenschein J.S. (1993). Planning to please: Following another agent\u2019s intended plan. Group Decision and Negotiation 2(3): 219\u2013235","journal-title":"Group Decision and Negotiation"},{"key":"9006_CR7","unstructured":"Felner, A. (1995). Searching for an alternative plan. Master\u2019s thesis, Department of Computer Science, The Hebrew University, Jerusalem, Israel."},{"key":"9006_CR8","doi-asserted-by":"crossref","unstructured":"Felner, A., Pomeransky, A., & Rosenschein, J. S. (2003). Searching for an alternative plan. In Proceedings of the second international joint conference on autonomous agents and multi-agent systems (pp. 33\u201340). Melbourne, Australia.","DOI":"10.1145\/860575.860582"},{"key":"9006_CR9","doi-asserted-by":"crossref","unstructured":"Haigh, K. Z., & Veloso, M. (1995). Route planning by analogy. In Proceedings of the international conference on case-based reasoning.","DOI":"10.1007\/3-540-60598-3_16"},{"issue":"2","key":"9006_CR10","doi-asserted-by":"publisher","first-page":"100","DOI":"10.1109\/TSSC.1968.300136","volume":"4","author":"P.E. Hart","year":"1968","unstructured":"Hart P.E., Nilsson N.J., Raphael B. (1968). A formal basis for the heuristic determination of minimum cost paths. IEEE Transactions on Systems Science and Cybernetics SSC-4(2): 100\u2013107","journal-title":"IEEE Transactions on Systems Science and Cybernetics SSC"},{"key":"9006_CR11","volume-title":"Grundzuege der Mengenlehre","author":"F. Hausdorff","year":"1914","unstructured":"Hausdorff F. (1914). Grundzuege der Mengenlehre. Viet, Leipzig"},{"key":"9006_CR12","unstructured":"Jain A., Meeran, S. (1998). A state-of-the-art review of job-shop scheduling techniques."},{"key":"9006_CR13","doi-asserted-by":"crossref","unstructured":"Jensen, R. M., & Veloso, M. M. (1999). OBDD-based universal planning: Specifying and solving planning problems for synchronized agents in non-deterministic domains. Artificial Intelligence Today, Recent Trends and Developments, p 212\u2013248.","DOI":"10.1007\/3-540-48317-9_9"},{"key":"9006_CR14","doi-asserted-by":"crossref","unstructured":"Karger D., Stein C., Wein J. (1997). Scheduling algorithms. In: Atallah M.J.(ed) Handbook of algorithms and theory of computation. CRC Press","DOI":"10.1201\/9781420049503-c36"},{"key":"9006_CR15","unstructured":"Koenig, S., & Likhachev, M. (2002). D\n                           * lite. In Proceedings of the eighteenth national conference on artificial intelligence (pp. 476\u2013483). Edmonton, Canada."},{"key":"9006_CR16","unstructured":"Koenig, S., & Likhachev, M. (2002). Incremental A\n                           *. In Advances in neural information processing systems 14 (NIPS). Cambridge, MA: MIT Press."},{"key":"9006_CR17","doi-asserted-by":"crossref","unstructured":"Leung, J., & Anderson, J. H. (2004). Handbook of scheduling. CRC Press.","DOI":"10.1201\/9780203489802"},{"key":"9006_CR18","unstructured":"Li, W., & Zhang, M. (1999). Distributed task plan: A model for designing autonomous mobile agents. In Proceedings of the international conference on artificial intelligence (pp. 336\u2013342). Las-Vegas."},{"key":"9006_CR19","unstructured":"Liu, B. (1996). Intelligent route finding: Combining knowledge, cases and an efficient search algorithm. In Proceedings of ECAI-96, (pp. 380\u2013384). Budapest, Hungary."},{"issue":"4","key":"9006_CR20","doi-asserted-by":"publisher","first-page":"318","DOI":"10.1109\/TC.1985.5009382","volume":"34","author":"H. Mannila","year":"1985","unstructured":"Mannila H. (1985). Measures of presortedness and optimal sorting algorithms. IEEE Transactions on Computers 34(4): 318\u2013325","journal-title":"IEEE Transactions on Computers"},{"issue":"2","key":"9006_CR21","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1559\/152304086783900059","volume":"13","author":"R.B. McMaster","year":"1986","unstructured":"McMaster R.B. (1986). A statistical analysis of mathematical measures for linear simplification. The American Cartographer 13(2): 103\u2013117","journal-title":"The American Cartographer"},{"key":"9006_CR22","doi-asserted-by":"crossref","first-page":"101","DOI":"10.3138\/C213-3627-90X7-LR15","volume":"26","author":"R.B. McMaster","year":"1989","unstructured":"McMaster R.B. (1989). The integration of simplification and smoothing algorithms in line generalization. Cartographica 26, 101\u2013121","journal-title":"Cartographica"},{"key":"9006_CR23","unstructured":"McMaster, R. B. (2001). Measurement in generalization. In Proceedings of the twentieth international cartography conference. (pp. 20\u201382)."},{"key":"9006_CR24","unstructured":"Myers, K. L., & Lee, Thomas J. (1999). Generating qualitatively different plans through metatheoretic biases. In Proceedings of the sixteenth national conference on artificial intelligence. (pp. 570\u2013576). Menlo Park, CA, USA: American Association for Artificial Intelligence."},{"key":"9006_CR25","doi-asserted-by":"publisher","first-page":"427","DOI":"10.1016\/0004-3702(94)00082-C","volume":"76","author":"B. Nebel","year":"1995","unstructured":"Nebel B., Koehler J. (1995). Plan reuse versus plan generation. Artificial Intelligence 76, 427\u2013454","journal-title":"Artificial Intelligence"},{"key":"9006_CR26","unstructured":"Okabe A., Boots B., Sugihara K. Spatial tessellations, concepts, and applications of voronoi diagrams. Chichester, UK: Wiley"},{"key":"9006_CR27","unstructured":"Russell, S., & Norvig, P. (2005). Artificial intelligence, a modern approach, 2nd edn. Prentice Hall."},{"key":"9006_CR28","volume-title":"Line scheduling\u2014a survey, on-line algorithms. Lecture Notes in Computer Science","author":"J. Sgall","year":"1997","unstructured":"Sgall J. (1997). Line scheduling\u2014a survey, on-line algorithms. Lecture Notes in Computer Science. Berlin, Springer-Verlag"},{"key":"9006_CR29","unstructured":"Sorensen, K. (2003). Distance measures based on the edit distance for permutation type representations. In Proceedings of the workshop on analysis and design of representations and operators (pp. 29\u201335). Chicago, USA."},{"key":"9006_CR30","unstructured":"Sorensen, K., Reimann, M., & Prins, C. (1994). Permutation distance measures for memetic algorithms with population management. In Proceedings of MIC sixth metaheuristics international conference. Vienna, Austria."},{"key":"9006_CR31","doi-asserted-by":"crossref","unstructured":"Stentz, A. (1994). Optimal and efficient path planning for partially-known environments. In Proceedings of ICRA (pp. 3310\u20133317).","DOI":"10.1109\/ROBOT.1994.351061"}],"container-title":["Autonomous Agents and Multi-Agent Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10458-006-9006-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10458-006-9006-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10458-006-9006-1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10458-006-9006-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,5,17]],"date-time":"2022-05-17T22:06:14Z","timestamp":1652825174000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10458-006-9006-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006,11,3]]},"references-count":31,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2007,6]]}},"alternative-id":["9006"],"URL":"https:\/\/doi.org\/10.1007\/s10458-006-9006-1","relation":{},"ISSN":["1387-2532","1573-7454"],"issn-type":[{"value":"1387-2532","type":"print"},{"value":"1573-7454","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006,11,3]]},"assertion":[{"value":"3 November 2006","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}