{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,14]],"date-time":"2025-05-14T07:48:54Z","timestamp":1747208934810},"reference-count":18,"publisher":"Walter de Gruyter GmbH","issue":"6","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019,6,26]]},"abstract":"<jats:title>Zusammenfassung<\/jats:title>\n               <jats:p>F\u00fcr Aufgaben wie dem Reinigen von Au\u00dfenanlagen oder Rasenm\u00e4hen ben\u00f6tigen mobile Roboter effiziente Algorithmen zur L\u00f6sung des Coverage Path Planning (CPP) Problems. Da stetig variierende Umgebungsbedingungen auf CPP-Probleme mit hoher Komplexit\u00e4t f\u00fchren, wird h\u00e4ufig auf echtzeitf\u00e4hige heuristische Ans\u00e4tze mit Vorgaben an die maximale Rechenzeit ausgewichen. Dar\u00fcber hinaus ist ein m\u00f6glichst energieeffizienter Pfad erstrebenswert, da die Batteriekapazit\u00e4t von mobilen Robotern begrenzt ist. Diese Ver\u00f6ffentlichung stellt zwei CPP-Algorithmen vor, die den Energieverbrauch eines mobilen Roboters mit und ohne Kenntnis der Umgebung ber\u00fccksichtigen. Der Energieverbrauch, die ben\u00f6tigte Fahrtzeit, die Pfadl\u00e4nge und die Rechenzeit der vorgestellten Algorithmen werden simulativ mit zwei existierenden Methoden verglichen.<\/jats:p>","DOI":"10.1515\/auto-2018-0128","type":"journal-article","created":{"date-parts":[[2019,6,12]],"date-time":"2019-06-12T09:02:15Z","timestamp":1560330135000},"page":"468-476","source":"Crossref","is-referenced-by-count":2,"title":["Echtzeitf\u00e4hige energiereduzierte Pfadplanung f\u00fcr Mobile Roboter"],"prefix":"10.1515","volume":"67","author":[{"given":"Marcel","family":"Mitschke","sequence":"first","affiliation":[{"name":"Universit\u00e4t Stuttgart , Institut f\u00fcr Systemdynamik , Stuttgart , Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Naoki","family":"Uchiyama","sequence":"additional","affiliation":[{"name":"Toyohashi University of Technology , Department of Mechanical Engineering , Toyohashi , Japan"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Oliver","family":"Sawodny","sequence":"additional","affiliation":[{"name":"Universit\u00e4t Stuttgart , Institut f\u00fcr Systemdynamik , Stuttgart , Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"374","published-online":{"date-parts":[[2019,6,8]]},"reference":[{"key":"2023033109582585538_j_auto-2018-0128_ref_001_w2aab3b7b2b1b6b1ab1b4b1Aa","unstructured":"Gabriely, Yoav and Rimon, Elon, Spanning-tree based coverage of continuous areas by a mobile robot, IEEE International Conference on Robotics and Automation, 1999, pp.\u20091927\u20131933."},{"key":"2023033109582585538_j_auto-2018-0128_ref_002_w2aab3b7b2b1b6b1ab1b4b2Aa","doi-asserted-by":"crossref","unstructured":"Gabriely, Yoav and Rimon, Elon, Competitive on-line coverage of grid environments by a mobile robot, Computational Geometry, 2003, vol.\u200924, no.\u20093, pp.\u2009197\u2013224.10.1016\/S0925-7721(02)00110-4","DOI":"10.1016\/S0925-7721(02)00110-4"},{"key":"2023033109582585538_j_auto-2018-0128_ref_003_w2aab3b7b2b1b6b1ab1b4b3Aa","unstructured":"Zelinsky, Alexander et al., Planning paths of complete coverage of an unstructured environment by a mobile robot, International Conference on Advanced Robotics, 1993, vol.\u200913, pp.\u2009533\u2013538."},{"key":"2023033109582585538_j_auto-2018-0128_ref_004_w2aab3b7b2b1b6b1ab1b4b4Aa","doi-asserted-by":"crossref","unstructured":"Zhou, Peng et al., Complete Coverage Path Planning of Mobile Robot Based on Dynamic Programming Algorithm, 2nd International Conference on Electronic and Mechanical Engineering and Information Technology, 2012, pp.\u20091837\u20131841.","DOI":"10.2991\/emeit.2012.407"},{"key":"2023033109582585538_j_auto-2018-0128_ref_005_w2aab3b7b2b1b6b1ab1b4b5Aa","doi-asserted-by":"crossref","unstructured":"Wang, Zhongmin and Bo, Zhu, Coverage path planning for mobile robot based on genetic algorithm, IEEE Workshop on Electronics, Computer and Applications, 2014, pp.\u2009732\u2013735.","DOI":"10.1109\/IWECA.2014.6845726"},{"key":"2023033109582585538_j_auto-2018-0128_ref_006_w2aab3b7b2b1b6b1ab1b4b6Aa","unstructured":"Clausen, Jens, Branch and bound algorithms-principles and examples, Department of Computer Science, University of Copenhagen, 1999, pp.\u20091\u201330."},{"key":"2023033109582585538_j_auto-2018-0128_ref_007_w2aab3b7b2b1b6b1ab1b4b7Aa","doi-asserted-by":"crossref","unstructured":"Jimenez, Paulo A. et al., Optimal area covering using genetic algorithms, IEEE\/ASME international conference on advanced intelligent mechatronics, 2007, pp.\u20091\u20135.","DOI":"10.1109\/AIM.2007.4412480"},{"key":"2023033109582585538_j_auto-2018-0128_ref_008_w2aab3b7b2b1b6b1ab1b4b8Aa","unstructured":"Ribes, Marcel Tresanchez et al., Optimization of Floor Cleaning Coverage Performance of a Random Path-Planning Mobile Robot, Universitat de Lleida, Escola Politecnica Superior, Enginyeria en Informatica, 2007."},{"key":"2023033109582585538_j_auto-2018-0128_ref_009_w2aab3b7b2b1b6b1ab1b4b9Aa","unstructured":"Gonzalez, Enrique et al., BSA: a complete coverage algorithm, IEEE International Conference on Robotics and Automation, 2005, pp.\u20092040\u20132044."},{"key":"2023033109582585538_j_auto-2018-0128_ref_010_w2aab3b7b2b1b6b1ab1b4c10Aa","doi-asserted-by":"crossref","unstructured":"Uchiyama, Naoki et al., Model-reference control approach to obstacle avoidance for a human-operated mobile robot, IEEE Transactions on Industrial Electronics, 2009, vol.\u200956, no.\u200910, pp.\u20093892\u20133896.10.1109\/TIE.2009.2020715","DOI":"10.1109\/TIE.2009.2020715"},{"key":"2023033109582585538_j_auto-2018-0128_ref_011_w2aab3b7b2b1b6b1ab1b4c11Aa","doi-asserted-by":"crossref","unstructured":"Simba, Kenneth Renny et al., Vision-based smooth obstacle avoidance motion trajectory generation for autonomous mobile robots using B\u00e9zier curves, Proceedings of the Institution of Mechanical Engineers, Part C: Journal of Mechanical Engineering Science, 2015, vol.\u2009231, no.\u20093, pp.\u2009541\u2013554.","DOI":"10.1177\/0954406215616986"},{"key":"2023033109582585538_j_auto-2018-0128_ref_012_w2aab3b7b2b1b6b1ab1b4c12Aa","doi-asserted-by":"crossref","unstructured":"Simba, Kenneth Renny et al., Real-Time Smooth Trajectory Generation for Nonholonomic Mobile Robots Using Bezier Curves, Robotics and Computer Integrated Manufacturing, 2016, vol.\u200941, pp.\u200931\u201342.10.1016\/j.rcim.2016.02.002","DOI":"10.1016\/j.rcim.2016.02.002"},{"key":"2023033109582585538_j_auto-2018-0128_ref_013_w2aab3b7b2b1b6b1ab1b4c13Aa","doi-asserted-by":"crossref","unstructured":"Schaefle, Tobias Reiner et al., Coverage Path Planning for Mobile Robots Using Genetic Algorithm with Energy Optimization, International Electronics Symposium, IEEE, 2016, pp.\u200999\u2013104.","DOI":"10.1109\/ELECSYM.2016.7860983"},{"key":"2023033109582585538_j_auto-2018-0128_ref_014_w2aab3b7b2b1b6b1ab1b4c14Aa","doi-asserted-by":"crossref","unstructured":"Siddique, Nazmul, Intelligent control: a hybrid approach based on fuzzy logic, neural networks and genetic algorithms, Springer, 2013.","DOI":"10.1007\/978-3-319-02135-5"},{"key":"2023033109582585538_j_auto-2018-0128_ref_015_w2aab3b7b2b1b6b1ab1b4c15Aa","doi-asserted-by":"crossref","unstructured":"Kapanoglu, Muzaffer et al., Pattern-based genetic algorithm approach to coverage path planning for mobile robots, International Conference on Computational Science, 2009, pp.\u200933\u201342.","DOI":"10.1007\/978-3-642-01970-8_4"},{"key":"2023033109582585538_j_auto-2018-0128_ref_016_w2aab3b7b2b1b6b1ab1b4c16Aa","doi-asserted-by":"crossref","unstructured":"Zelinsky, Alexander, Environment exploration and path planning algorithms for mobile robot navigation using sonar, University of Wollongong, 1991.","DOI":"10.1002\/rob.4620080502"},{"key":"2023033109582585538_j_auto-2018-0128_ref_017_w2aab3b7b2b1b6b1ab1b4c17Aa","doi-asserted-by":"crossref","unstructured":"Mei, Yongguo et al., Energy-efficient motion planning for mobile robots, IEEE International Conference on Robotics and Automation, 2004, pp.\u20094344\u20134349.","DOI":"10.1109\/ROBOT.2004.1302401"},{"key":"2023033109582585538_j_auto-2018-0128_ref_018_w2aab3b7b2b1b6b1ab1b4c18Aa","unstructured":"Xuan, Wang, Li, Yuanxiang. Solving traveling salesman problem by using a local evolutionary algorithm. Granular Computing, 2005 IEEE International Conference on. IEEE, 2005. S.\u2009318\u2013321."}],"container-title":["at - Automatisierungstechnik"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/www.degruyter.com\/view\/j\/auto.2019.67.issue-6\/auto-2018-0128\/auto-2018-0128.xml","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.degruyter.com\/document\/doi\/10.1515\/auto-2018-0128\/xml","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.degruyter.com\/document\/doi\/10.1515\/auto-2018-0128\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,3,31]],"date-time":"2023-03-31T10:30:48Z","timestamp":1680258648000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.degruyter.com\/document\/doi\/10.1515\/auto-2018-0128\/html"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,6,1]]},"references-count":18,"journal-issue":{"issue":"6","published-online":{"date-parts":[[2019,6,8]]},"published-print":{"date-parts":[[2019,6,26]]}},"alternative-id":["10.1515\/auto-2018-0128"],"URL":"https:\/\/doi.org\/10.1515\/auto-2018-0128","relation":{},"ISSN":["2196-677X","0178-2312"],"issn-type":[{"value":"2196-677X","type":"electronic"},{"value":"0178-2312","type":"print"}],"subject":[],"published":{"date-parts":[[2019,6,1]]}}}