{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,22]],"date-time":"2024-10-22T16:29:08Z","timestamp":1729614548950,"version":"3.28.0"},"reference-count":15,"publisher":"IEEE","license":[{"start":{"date-parts":[[2019,10,1]],"date-time":"2019-10-01T00:00:00Z","timestamp":1569888000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2019,10,1]],"date-time":"2019-10-01T00:00:00Z","timestamp":1569888000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2019,10,1]],"date-time":"2019-10-01T00:00:00Z","timestamp":1569888000000},"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":[[2019,10]]},"DOI":"10.1109\/smc.2019.8913902","type":"proceedings-article","created":{"date-parts":[[2019,11,29]],"date-time":"2019-11-29T10:09:34Z","timestamp":1575022174000},"page":"3168-3173","source":"Crossref","is-referenced-by-count":1,"title":["Electric Vehicle Travel Planning with Lazy Evaluation of Recharging Times"],"prefix":"10.1109","author":[{"given":"Marek","family":"Cuchy","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michal","family":"Jakob","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","article-title":"Planning single-arm manipulations with n-arm robots","author":"cohen","year":"2015","journal-title":"Proceedings of Robotics Science and Systems"},{"key":"ref11","doi-asserted-by":"crossref","first-page":"459","DOI":"10.1609\/icaps.v26i1.13788","article-title":"A unifying formalism for shortest path problems with expensive edge evaluations via lazy best-first search over paths with edge selectors","author":"dellin","year":"2016","journal-title":"Proceedings of the International Conference on Automated Planning and Scheduling (ICAPS)"},{"key":"ref12","first-page":"923","article-title":"A* with partial expansion for large branching factor problems","author":"yoshizumi","year":"2000","journal-title":"Proceedings of the 17th National Conference on Artificial Intelligence"},{"key":"ref13","doi-asserted-by":"crossref","DOI":"10.1609\/icaps.v27i1.13860","article-title":"Heuristic search on graphs with existence priors for expensive-to-evaluate edges","author":"narayanan","year":"2017","journal-title":"Proceedings of the International Conference on Automated Planning and Scheduling (ICAPS)"},{"key":"ref14","doi-asserted-by":"crossref","DOI":"10.1609\/icaps.v24i1.13652","article-title":"PA* SE: Parallel A* for slow expansions","author":"phillips","year":"2014","journal-title":"Proceedings of the International Conference on Automated Planning and Scheduling (ICAPS)"},{"key":"ref15","article-title":"A new approach to multiobjective A* search","volume":"8","author":"mandow","year":"2005","journal-title":"Proceedings of the 19th International Joint Conference on Artificial Intelligence"},{"key":"ref4","doi-asserted-by":"crossref","DOI":"10.1609\/aaai.v25i1.7803","article-title":"Efficient energy-optimal routing for electric vehicles","author":"sachenbacher","year":"2011","journal-title":"Proc of the 25th Conference on Artificial Intelligence"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1287\/trsc.23.1.1"},{"key":"ref6","doi-asserted-by":"crossref","first-page":"1108","DOI":"10.1609\/aaai.v25i1.7991","article-title":"Optimal route planning for electric vehicles in large networks","author":"eisner","year":"2011","journal-title":"Proc of the 25th Conference on Artificial Intelligence"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TSSC.1968.300136"},{"key":"ref8","first-page":"52","article-title":"Planning with incomplete information as heuristic search in belief space","author":"bonet","year":"2000","journal-title":"Proceedings of the Fifth International Conference on Artificial Intelligence Planning Systems"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-28929-8"},{"key":"ref2","article-title":"Shortest path problems with resource constraints","volume":"5","author":"desaulniers","year":"2006","journal-title":"Column Generation"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1002\/nav.3800250314"},{"key":"ref9","first-page":"969","article-title":"Route planning under uncertainty: The canadian traveller problem","author":"nikolova","year":"2008","journal-title":"Proceedings of the 23rd Conference on Artificial Intelligence"}],"event":{"name":"2019 IEEE International Conference on Systems, Man and Cybernetics (SMC)","start":{"date-parts":[[2019,10,6]]},"location":"Bari, Italy","end":{"date-parts":[[2019,10,9]]}},"container-title":["2019 IEEE International Conference on Systems, Man and Cybernetics (SMC)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8906183\/8913838\/08913902.pdf?arnumber=8913902","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,10,7]],"date-time":"2022-10-07T02:53:12Z","timestamp":1665111192000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8913902\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,10]]},"references-count":15,"URL":"https:\/\/doi.org\/10.1109\/smc.2019.8913902","relation":{},"subject":[],"published":{"date-parts":[[2019,10]]}}}