{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T17:55:18Z","timestamp":1725558918790},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642144028"},{"type":"electronic","value":"9783642144035"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-14403-5_56","type":"book-chapter","created":{"date-parts":[[2010,7,7]],"date-time":"2010-07-07T13:01:33Z","timestamp":1278507693000},"page":"529-538","source":"Crossref","is-referenced-by-count":1,"title":["Two Concurrent Algorithms of Discrete Potential Field Construction"],"prefix":"10.1007","author":[{"given":"Konrad","family":"Ku\u0142akowski","sequence":"first","affiliation":[]},{"given":"Jaros\u0142aw","family":"W\u0105s","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"56_CR1","doi-asserted-by":"crossref","unstructured":"Geraerts, R., Overmars, M.H.: The Corridor Map Method: Real-Time High-Quality Path Planning. In: Proceedings of International Conference on Robotics and Automation, ICRA (2007)","DOI":"10.1109\/ROBOT.2007.363119"},{"key":"56_CR2","unstructured":"Heinemann, P., Becker, H., Zell, A.: Improved path planning in highly dynamic environments based on time variant potential fields. VDI BERICHTE (2006)"},{"key":"56_CR3","unstructured":"Wang, Y., Chirikjian, G.S.: A new potential field method for robot path planning. In: Proceedings of International Conference on Robotics and Automation (2000)"},{"key":"56_CR4","doi-asserted-by":"crossref","unstructured":"Barraquand, J., Langlas, B., Latombe, J.C.: Numerical potential field techniques for robot path planning. IEEE Trans. Systems, Man and Cybernetics (1992)","DOI":"10.1109\/ICAR.1991.240539"},{"key":"56_CR5","unstructured":"Kretz, T., Bonisch, C., Vortisch, P.: Comparison of various methods for the calculation of the distance potential field (2008)"},{"key":"56_CR6","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"1101","DOI":"10.1007\/11785231_115","volume-title":"Artificial Intelligence and Soft Computing \u2013 ICAISC 2006","author":"E. Dudek-Dyduch","year":"2006","unstructured":"Dudek-Dyduch, E., W\u0105s, J.: Knowledge representation of Pedestrian Dynamics in Crowd. In: Rutkowski, L., Tadeusiewicz, R., Zadeh, L.A., \u017burada, J.M. (eds.) ICAISC 2006. LNCS (LNAI), vol.\u00a04029, pp. 1101\u20131110. Springer, Heidelberg (2006)"},{"key":"56_CR7","doi-asserted-by":"crossref","unstructured":"Treuille, A., Cooper, S., Popovi\u0107, Z.: Continuum crowds. In: Proceedings of International Conference on Computer Graphics and Interactive Techniques (2006)","DOI":"10.1145\/1179352.1142008"},{"key":"56_CR8","volume-title":"Introduction to AI Robotics","author":"R.R. Murphy","year":"2000","unstructured":"Murphy, R.R.: Introduction to AI Robotics. MIT Press, Cambridge (2000)"},{"key":"56_CR9","doi-asserted-by":"crossref","unstructured":"Behring, C., Bracho, M., Castro, M., Moreno, J.A.: An algorithm for robot path planning with cellular automata. In: Proceedings of the Fourth International Conference on Cellular Automata for Research and Industry (2000)","DOI":"10.1007\/978-1-4471-0709-5_2"},{"key":"56_CR10","doi-asserted-by":"crossref","unstructured":"Xiaoxi, H., Leiting, C.: Path planning based on grid-potential fields. In: Proceedings of International Conference on Computer Science and Software Engineering (2008)","DOI":"10.1109\/CSSE.2008.879"},{"key":"56_CR11","doi-asserted-by":"crossref","unstructured":"Flynn, M.: Some computer organizations and their effectiveness. IEEE Transactions on Computers (1972)","DOI":"10.1109\/TC.1972.5009071"},{"key":"56_CR12","volume-title":"Design Principles and Patterns","author":"D. Lea","year":"1999","unstructured":"Lea, D.: Concurrent Programming in Java. In: Design Principles and Patterns, 2nd edn. Addison-Wesley Longman Publishing Co., Inc., Amsterdam (1999)","edition":"2"}],"container-title":["Lecture Notes in Computer Science","Parallel Processing and Applied Mathematics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-14403-5_56.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,24]],"date-time":"2020-11-24T02:52:23Z","timestamp":1606186343000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-14403-5_56"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642144028","9783642144035"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-14403-5_56","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}