{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,20]],"date-time":"2025-01-20T00:40:01Z","timestamp":1737333601996,"version":"3.33.0"},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540742012"},{"type":"electronic","value":"9783540742050"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2007]]},"DOI":"10.1007\/978-3-540-74205-0_58","type":"book-chapter","created":{"date-parts":[[2007,7,30]],"date-time":"2007-07-30T04:32:41Z","timestamp":1185769961000},"page":"534-542","source":"Crossref","is-referenced-by-count":0,"title":["A Genetic Algorithm for Shortest Path Motion Problem in Three Dimensions"],"prefix":"10.1007","author":[{"given":"Marzio","family":"Pennisi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Francesco","family":"Pappalardo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alfredo","family":"Motta","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alessandro","family":"Cincotti","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"58_CR1","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1016\/0020-0190(85)90029-8","volume":"20","author":"C.H. Papadimitriou","year":"1985","unstructured":"Papadimitriou, C.H.: An Algorithm for Shortest-Path Motion in Three Dimensions. Inform Process Lett.\u00a020, 259\u2013263 (1985)","journal-title":"Inform Process Lett."},{"key":"58_CR2","doi-asserted-by":"crossref","unstructured":"Canny, J., Reif, J.H.: Lower Bound for Shortest Paths and Related Problems. In: Proceedings of 28th Annual Symposium on Foundations of Computer Science, pp. 49\u201360 (1987)","DOI":"10.1109\/SFCS.1987.42"},{"key":"58_CR3","first-page":"56","volume-title":"Proceedings of 19th Annual ACM Symposium on Theory of Computing","author":"K.L. Clarkson","year":"1987","unstructured":"Clarkson, K.L.: Approximation algorithms for shortest path motion planning. In: Proceedings of 19th Annual ACM Symposium on Theory of Computing, pp. 56\u201365. ACM Press, New York (1987)"},{"key":"58_CR4","first-page":"1","volume-title":"Optimization and Machine Learning","author":"D.E. Goldberg","year":"1989","unstructured":"Goldberg, D.E.: Genetic Algorithms in Search. In: Optimization and Machine Learning, pp. 1\u201388. Addison-Wesley, Reading (1989)"},{"key":"58_CR5","doi-asserted-by":"crossref","unstructured":"Zhang, L., Thomopoulos, S.C.A: Neural Network Implementation of the Shortest Path Algorithm for Traffic Routing in Communication Networks. In: International Joint Conference on Neural Networks, vol. 2, p. 591 (1989)","DOI":"10.1109\/IJCNN.1989.118375"},{"key":"58_CR6","doi-asserted-by":"crossref","unstructured":"Fujimura, K., Samet, H.: Planning A Time-Minimal Motion among Moving Obstacles. Algorithmica, vol.10, pp. 41\u201363 (1993)","DOI":"10.1007\/BF01908631"},{"issue":"5","key":"58_CR7","doi-asserted-by":"publisher","first-page":"395","DOI":"10.1177\/027836499401300502","volume":"13","author":"K. Fujimura","year":"1994","unstructured":"Fujimura, K.: Motion Planning Amid Transient Obstacles. International Journal of Robotics Research\u00a013(5), 395\u2013407 (1994)","journal-title":"International Journal of Robotics Research"},{"key":"58_CR8","doi-asserted-by":"crossref","unstructured":"Choi, J., Sellen, J., Chee, K.Y.: Approximate Euclidean Shortest Path in 3-space. Annual Symposium on Computational Geometry Archive. In: Proceedings of the Tenth Annual Symposium on Computational Geometry, pp. 41\u201348 (1994)","DOI":"10.1145\/177424.177501"},{"key":"58_CR9","doi-asserted-by":"crossref","unstructured":"Reif, J.H., Storer, J.A.: A Single-Exponential Upper Bound for Finding Shortest Paths in Three Dimensions. J. ACM 1013\u20131019 (1994)","DOI":"10.1145\/185675.185811"},{"key":"58_CR10","doi-asserted-by":"crossref","unstructured":"Whitley, D.: A Genetic Algorithm Tutorial. Statistics and Computing, 65\u201385 (1994)","DOI":"10.1007\/BF00175354"},{"key":"58_CR11","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1201\/9781420050073","volume-title":"Practical Handbook of Genetic Algorithms,Applications","author":"L. Chambers","year":"1995","unstructured":"Chambers, L.: Practical Handbook of Genetic Algorithms,Applications, pp. 143\u2013172. CRC Press, Boca Raton (1995)"},{"key":"58_CR12","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/3927.001.0001","volume-title":"An Introduction to Genetic Algorithms","author":"M. Mitchell","year":"1996","unstructured":"Mitchell, M.: An Introduction to Genetic Algorithms. MIT Press, Cambridge (1996)"},{"key":"58_CR13","doi-asserted-by":"crossref","unstructured":"Baran, B., Sosa,R.: A new approach for AntNet routing. Proceedings. In: Ninth International Conference on Computer Communications and Networks, pp. 303\u2013308 (2000)","DOI":"10.1109\/ICCCN.2000.885506"},{"issue":"2","key":"58_CR14","doi-asserted-by":"publisher","first-page":"42","DOI":"10.1145\/844193.844197","volume":"31","author":"B. Baran","year":"2001","unstructured":"Baran, B.: Improved AntNet routing. ACM SIGCOMM Computer Communication Review\u00a031(2), 42\u201348 (2001)","journal-title":"ACM SIGCOMM Computer Communication Review"},{"key":"58_CR15","doi-asserted-by":"crossref","unstructured":"Mitchell, J.S.B., Sharir, M.: New Results on Shortest Paths in Three Dimensions. In: Annual Symposium on Computational Geometry Archive Proceedings of the Twentieth Annual Symposium on Computational Geometry, pp. 124\u2013133 (2004)","DOI":"10.1145\/997817.997839"}],"container-title":["Lecture Notes in Computer Science","Advanced Intelligent Computing Theories and Applications. With Aspects of Artificial Intelligence"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-74205-0_58.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,20]],"date-time":"2025-01-20T00:22:57Z","timestamp":1737332577000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-74205-0_58"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007]]},"ISBN":["9783540742012","9783540742050"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-74205-0_58","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2007]]}}}