{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,29]],"date-time":"2024-10-29T16:46:18Z","timestamp":1730220378472,"version":"3.28.0"},"reference-count":28,"publisher":"IEEE","license":[{"start":{"date-parts":[[2021,9,7]],"date-time":"2021-09-07T00:00:00Z","timestamp":1630972800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2021,9,7]],"date-time":"2021-09-07T00:00:00Z","timestamp":1630972800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021,9,7]]},"DOI":"10.1109\/etfa45728.2021.9613457","type":"proceedings-article","created":{"date-parts":[[2021,12,1]],"date-time":"2021-12-01T00:13:36Z","timestamp":1638317616000},"page":"01-08","source":"Crossref","is-referenced-by-count":3,"title":["Optimized Online Path Planning Algorithms Considering Energy"],"prefix":"10.1109","author":[{"given":"Sudha","family":"Ramasamy","sequence":"first","affiliation":[{"name":"University West Trollhattan,Department of Production Systems"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kristina","family":"Eriksson","sequence":"additional","affiliation":[{"name":"University West Trollhattan,Department of Production Systems"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Saptha","family":"Peralippatt","sequence":"additional","affiliation":[{"name":"University West Trollhattan,Department of Production Systems"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Balasubramanian","family":"Perumal","sequence":"additional","affiliation":[{"name":"University West Trollhattan,Department of Production Systems"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Fredrik","family":"Danielsson","sequence":"additional","affiliation":[{"name":"University West Trollhattan,Department of Production Systems"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","article-title":"A review of application of graph theory for network","author":"sadavare","year":"0","journal-title":"International Journal of Computer Science and Information Technologies 2012"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1155\/2016\/7426913"},{"key":"ref12","article-title":"A delaunay triangulation based node connection strategy for probabilistic roadmap planners","author":"huang","year":"0","journal-title":"IEEE International Conference on Robotics and Automation"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-45058-0_4"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/ROBOT.2004.1307190"},{"key":"ref15","volume":"1","author":"saha","year":"2006","journal-title":"Motion Planning With Probabilistic Roadmaps"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/70.508439"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1007\/BF01386390"},{"key":"ref18","article-title":"Review of Graph Theory Algorithms","author":"meghanathan","year":"2012","journal-title":"Jackson State University REU Program"},{"journal-title":"Atlas Approximating Shortest Paths in Social Graphs","year":"2011","author":"cao","key":"ref19"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511546877"},{"key":"ref4","article-title":"Anytime motion planning using the RRT","author":"sertac","year":"0","journal-title":"IEEE International Conference on Robotics and Automation"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1016\/j.rcim.2014.12.005"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/ETFA.2019.8869398"},{"journal-title":"Principles of Robot Motion Theory Algorithms and Implementation","year":"2005","author":"choset","key":"ref6"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1177\/0278364911406761"},{"key":"ref8","doi-asserted-by":"crossref","first-page":"258","DOI":"10.1016\/j.cirpj.2011.03.007","article-title":"A framework for modelling energy consumption within manufacturing systems","volume":"4","author":"yingying","year":"2011","journal-title":"CIRP Journal of Manufacturing Science and Technology"},{"key":"ref7","article-title":"Research of shortest path algorithm based on the data structure","author":"lu","year":"0","journal-title":"IEEE International Conference on Computer Science and Automation Engineering"},{"journal-title":"An Introduction to Multiagent Systems","year":"2009","author":"wooldridge","key":"ref2"},{"key":"ref1","first-page":"889","article-title":"Scanning the industry 4.0: A literature review on technologies for manufacturing systems","volume":"22","author":"vitor","year":"2019","journal-title":"Engineering Science and Technology An International Journal"},{"key":"ref9","doi-asserted-by":"crossref","first-page":"78","DOI":"10.1016\/j.cirpj.2012.10.004","article-title":"Environmental aspects in manufacturing system modelling and simulation-State of the art and research perspectives","volume":"6","author":"sebastian","year":"2013","journal-title":"CIRP Journal of Manufacturing Science and Technology"},{"key":"ref20","article-title":"An investigation of Dijkstra and Floyd algorithms in national city traffic advisory procedures","author":"sangaiah","year":"0","journal-title":"International Journal of Computer Science and Mobile Computing 2014"},{"key":"ref22","article-title":"Path Finding: Astar and Dijkstra's","author":"goyal","year":"0","journal-title":"Department of information Technology Maharaja Surajmal Institute of Technology Delhi India"},{"key":"ref21","article-title":"Application of Dijkstra algorithm in robot path-planning","author":"wang","year":"0","journal-title":"Second International Conference on Mechanic Automation and Control Engineering"},{"key":"ref24","article-title":"An application of Dijkstra's Algorithm to shortest route problem","author":"ojekudo","year":"0","journal-title":"Department of Mathematics and Computer science Ignatius Ajuru University of Education Port Harcourt Rivers State Nigeria and Department of Mathematics and Statistics University of Port Harcourt Nigeria"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.14257\/ijsh.2014.8.3.07"},{"journal-title":"RobotStudio SDK","year":"2020","key":"ref26"},{"key":"ref25","article-title":"Dijkstra algorithm based intelligent path planning with topological map and wireless communication","author":"parungao","year":"0","journal-title":"ARPN Journal of Engineering and Applied Sciences 2018"}],"event":{"name":"2021 IEEE 26th International Conference on Emerging Technologies and Factory Automation (ETFA)","start":{"date-parts":[[2021,9,7]]},"location":"Vasteras, Sweden","end":{"date-parts":[[2021,9,10]]}},"container-title":["2021 26th IEEE International Conference on Emerging Technologies and Factory Automation (ETFA )"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/9613137\/9613141\/09613457.pdf?arnumber=9613457","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,5,8]],"date-time":"2024-05-08T17:31:33Z","timestamp":1715189493000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9613457\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,9,7]]},"references-count":28,"URL":"https:\/\/doi.org\/10.1109\/etfa45728.2021.9613457","relation":{},"subject":[],"published":{"date-parts":[[2021,9,7]]}}}