{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,11]],"date-time":"2024-09-11T04:50:06Z","timestamp":1726030206892},"publisher-location":"Cham","reference-count":13,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030209148"},{"type":"electronic","value":"9783030209155"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-030-20915-5_59","type":"book-chapter","created":{"date-parts":[[2019,5,27]],"date-time":"2019-05-27T13:03:06Z","timestamp":1558962186000},"page":"666-675","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":9,"title":["An Algorithm for Swarm Robot to Avoid Multiple Dynamic Obstacles and to Catch the Moving Target"],"prefix":"10.1007","author":[{"given":"Quoc Bao","family":"Diep","sequence":"first","affiliation":[]},{"given":"Ivan","family":"Zelinka","sequence":"additional","affiliation":[]},{"given":"Roman","family":"Senkerik","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,5,27]]},"reference":[{"issue":"3","key":"59_CR1","doi-asserted-by":"publisher","first-page":"278","DOI":"10.1109\/70.88137","volume":"7","author":"J Borenstein","year":"1991","unstructured":"Borenstein, J., Koren, Y.: The vector field histogram-fast obstacle avoidance for mobile robots. IEEE Trans. Robot. Autom. 7(3), 278\u2013288 (1991)","journal-title":"IEEE Trans. Robot. Autom."},{"key":"59_CR2","first-page":"1","volume":"99","author":"Y Chen","year":"2017","unstructured":"Chen, Y., Peng, H., Grizzle, J.: Obstacle avoidance for low-speed autonomous vehicles with barrier function. IEEE Trans. Control Syst. Technol. 99, 1\u201313 (2017)","journal-title":"IEEE Trans. Control Syst. Technol."},{"issue":"2","key":"59_CR3","first-page":"169","volume":"28","author":"D Davendra","year":"2012","unstructured":"Davendra, D., Zelinka, I.: Optimization of quadratic assignment problem using self organising migrating algorithm. Comput. Inform. 28(2), 169\u2013180 (2012)","journal-title":"Comput. Inform."},{"key":"59_CR4","doi-asserted-by":"crossref","unstructured":"Davendra, D., Zelinka, I., et al.: Self-organizing migrating algorithm. New Optimization Techniques in Engineering (2016)","DOI":"10.1007\/978-3-319-28161-2"},{"key":"59_CR5","unstructured":"Diep, Q.B., Zelinka, I.: Obstacle avoidance for swarm robot based on self-organizing migrating algorithm. In: XIIIth International Symposium Intelligent Systems, INTELS 2008, St. Petersburg, Russia (2018, accepted, in print)"},{"key":"59_CR6","doi-asserted-by":"publisher","first-page":"104","DOI":"10.1016\/j.eswa.2016.06.021","volume":"62","author":"M Duguleana","year":"2016","unstructured":"Duguleana, M., Mogan, G.: Neural networks based reinforcement learning for mobile robots obstacle avoidance. Expert Syst. Appl. 62, 104\u2013115 (2016)","journal-title":"Expert Syst. Appl."},{"key":"59_CR7","unstructured":"Hu, Y., Yang, S.X.: A knowledge based genetic algorithm for path planning of a mobile robot. In: 2004 Proceedings of IEEE International Conference on Robotics and Automation, ICRA 2004, vol. 5, pp. 4350\u20134355. IEEE (2004)"},{"key":"59_CR8","unstructured":"Koren, Y., Borenstein, J.: Potential field methods and their inherent limitations for mobile robot navigation. In: 1991 Proceedings of IEEE International Conference on Robotics and Automation, pp. 1398\u20131404. IEEE (1991)"},{"issue":"4","key":"59_CR9","doi-asserted-by":"publisher","first-page":"1026","DOI":"10.1016\/j.camwa.2010.03.059","volume":"60","author":"R Senkerik","year":"2010","unstructured":"Senkerik, R., Zelinka, I., Davendra, D., Oplatkova, Z.: Utilization of SOMA and differential evolution for robust stabilization of chaotic logistic equation. Comput. Math. Appl. 60(4), 1026\u20131037 (2010)","journal-title":"Comput. Math. Appl."},{"issue":"9","key":"59_CR10","doi-asserted-by":"publisher","first-page":"1123","DOI":"10.1016\/j.robot.2012.05.021","volume":"60","author":"V Sezer","year":"2012","unstructured":"Sezer, V., Gokasan, M.: A novel obstacle avoidance algorithm: \u201cfollow the gap method\u201d. Robot. Auton. Syst. 60(9), 1123\u20131134 (2012)","journal-title":"Robot. Auton. Syst."},{"key":"59_CR11","series-title":"Emergence, Complexity and Computation","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1007\/978-3-662-55663-4_5","volume-title":"Evolutionary Algorithms, Swarm Dynamics and Complex Networks","author":"L Tomaszek","year":"2018","unstructured":"Tomaszek, L., Zelinka, I.: Analysis of SOMA algorithm using complex network. In: Zelinka, I., Chen, G. (eds.) Evolutionary Algorithms, Swarm Dynamics and Complex Networks. ECC, vol. 26, pp. 115\u2013129. Springer, Heidelberg (2018). \n                      https:\/\/doi.org\/10.1007\/978-3-662-55663-4_5"},{"key":"59_CR12","series-title":"Studies in Fuzziness and Soft Computing","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1007\/978-3-540-39930-8_7","volume-title":"New Optimization Techniques in Engineering","author":"I Zelinka","year":"2004","unstructured":"Zelinka, I.: SOMA-self-organizing migrating algorithm. New Optimization Techniques in Engineering. Studies in Fuzziness and Soft Computing, vol. 141, pp. 167\u2013217. Springer, Heidelberg (2004). \n                      https:\/\/doi.org\/10.1007\/978-3-540-39930-8_7"},{"key":"59_CR13","series-title":"Studies in Computational Intelligence","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/978-3-319-28161-2_1","volume-title":"Self-Organizing Migrating Algorithm","author":"I Zelinka","year":"2016","unstructured":"Zelinka, I.: SOMA\u2014self-organizing migrating algorithm. In: Davendra, D., Zelinka, I. (eds.) Self-Organizing Migrating Algorithm. SCI, vol. 626, pp. 3\u201349. Springer, Cham (2016). \n                      https:\/\/doi.org\/10.1007\/978-3-319-28161-2_1"}],"container-title":["Lecture Notes in Computer Science","Artificial Intelligence and Soft Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-20915-5_59","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,27]],"date-time":"2019-05-27T13:15:26Z","timestamp":1558962926000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-20915-5_59"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030209148","9783030209155"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-20915-5_59","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"27 May 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICAISC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Artificial Intelligence and Soft Computing","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Zakopane","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Poland","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16 June 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20 June 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"icaisc2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/icaisc.eu\/About","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"Own online software","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"333","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"122","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"37% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"4","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"3","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}}]}}