{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,22]],"date-time":"2026-04-22T12:27:02Z","timestamp":1776860822423,"version":"3.51.2"},"reference-count":26,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2024,9,30]],"date-time":"2024-09-30T00:00:00Z","timestamp":1727654400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2024,9,30]],"date-time":"2024-09-30T00:00:00Z","timestamp":1727654400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100000266","name":"Engineering and Physical Sciences Research Council","doi-asserted-by":"crossref","award":["EP\/V022067\/1"],"award-info":[{"award-number":["EP\/V022067\/1"]}],"id":[{"id":"10.13039\/501100000266","id-type":"DOI","asserted-by":"crossref"}]},{"name":"Future Electric Vehicle Energy Networks supporting Renewables","award":["EP\/W005883\/1"],"award-info":[{"award-number":["EP\/W005883\/1"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Auton Agent Multi-Agent Syst"],"published-print":{"date-parts":[[2024,12]]},"abstract":"<jats:title>Abstract<\/jats:title>\n                  <jats:p>In this paper, we address the problem of finding charging stops while travelling in electric vehicles (EVs) using artificial intelligence (AI). Choosing a charging station is challenging, because drivers have very heterogeneous preferences in terms of how they trade off the features of various alternatives (for example, regarding the time spent driving, charging costs, waiting times at charging stations, and the facilities provided at the charging stations). The key problem here is eliciting the diverse preferences of drivers, assuming that these preferences are typically not fully known a priori, and then planning stops based on each driver\u2019s preferences. Our approach to solving this problem is to develop an intelligent personal agent that learns preferences gradually over multiple interactions. This study proposes a new technique that utilises a small-scale discrete choice experiment as a method of interacting with the driver in order to minimise the cognitive burden on the driver. Using this method, drivers are presented with a variety of routes with possible combinations of charging stops depending on the agent\u2019s latest belief about their preferences. In subsequent iterations, the personal agent will continue to learn and refine its belief about the driver\u2019s preferences, suggesting more personalised routes that are closer to the driver\u2019s preferences. Based on real preference data from EV drivers, we evaluate our novel algorithm and show that, after only a few queries, our method quickly converges to the optimal routes for EV drivers [This paper is an extended version of an ECAI workshop short paper (Shafipour\u00a0Yourdshahi et al., in: ECAI 2023 workshops, Krak\u00f3w, Poland, 2023)].<\/jats:p>","DOI":"10.1007\/s10458-024-09671-8","type":"journal-article","created":{"date-parts":[[2024,9,30]],"date-time":"2024-09-30T01:01:54Z","timestamp":1727658114000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Personalised electric vehicle charging stop planning through online estimators"],"prefix":"10.1007","volume":"38","author":[{"given":"Elnaz","family":"Shafipour","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sebastian","family":"Stein","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Selin","family":"Ahipasaoglu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,9,30]]},"reference":[{"key":"9671_CR1","unstructured":"Baarslag, T., & Gerding, E.\u00a0H. (2015). Optimal incremental preference elicitation during negotiation."},{"key":"9671_CR2","doi-asserted-by":"crossref","unstructured":"Bourdache, N., Perny, P., & Spanjaard, O. (2019). Incremental elicitation of rank-dependent aggregation functions based on Bayesian linear regression. In IJCAI-19-twenty-eighth international joint conference on artificial intelligence (pp. 2023\u20132029). International Joint Conferences on Artificial Intelligence Organization.","DOI":"10.24963\/ijcai.2019\/280"},{"key":"9671_CR3","doi-asserted-by":"crossref","unstructured":"Brandt, F., Lederer, P., & Suksompong, W. (2022). Incentives in social decision schemes with pairwise comparison preferences. arXiv preprint arXiv:2204.12436","DOI":"10.2139\/ssrn.4291730"},{"key":"9671_CR4","doi-asserted-by":"crossref","unstructured":"Crochepierre, L., Boudjeloud-Assala, L., & Barbesant, V. (2022). Interactive reinforcement learning for symbolic regression from multi-format human-preference feedbacks. In 31st International Joint Conference on Artificial Intelligence (IJCAI 2022).","DOI":"10.24963\/ijcai.2022\/849"},{"issue":"2","key":"9671_CR5","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1007\/s10458-022-09579-1","volume":"36","author":"D Filipczuk","year":"2022","unstructured":"Filipczuk, D., Baarslag, T., Gerding, E. H., & Schraefel, M. C. (2022). Automated privacy negotiations with preference uncertainty. Autonomous Agents and Multi-Agent Systems, 36(2), 49.","journal-title":"Autonomous Agents and Multi-Agent Systems"},{"issue":"9","key":"9671_CR6","doi-asserted-by":"publisher","first-page":"1026","DOI":"10.1016\/S0148-2963(02)00352-1","volume":"57","author":"J Hall","year":"2004","unstructured":"Hall, J., Viney, R., Haas, M., & Louviere, J. (2004). Using stated preference discrete choice modeling to evaluate health care programs. Journal of Business research, 57(9), 1026\u20131032.","journal-title":"Journal of Business research"},{"key":"9671_CR7","first-page":"117","volume":"21","author":"J Halpern","year":"1977","unstructured":"Halpern, J. (1977). Shortest route with time dependent length of edges and limited delay possibilities in nodes. Zeitschrift fuer Operations Research, 21, 117\u2013124.","journal-title":"Zeitschrift fuer Operations Research"},{"issue":"2","key":"9671_CR8","doi-asserted-by":"publisher","first-page":"100","DOI":"10.1109\/TSSC.1968.300136","volume":"4","author":"PE Hart","year":"1968","unstructured":"Hart, P. E., Nilsson, N. J., & Raphael, B. (1968). A formal basis for the heuristic determination of minimum cost paths. IEEE Transactions on Systems Science and Cybernetics, 4(2), 100\u2013107.","journal-title":"IEEE Transactions on Systems Science and Cybernetics"},{"key":"9671_CR9","doi-asserted-by":"publisher","DOI":"10.7551\/mitpress\/1090.001.0001","volume-title":"Adaptation in natural and artificial systems: An introductory analysis with applications to biology, control and artificial intelligence","author":"JH Holland","year":"1992","unstructured":"Holland, J. H. (1992). Adaptation in natural and artificial systems: An introductory analysis with applications to biology, control and artificial intelligence. MIT Press."},{"key":"9671_CR10","doi-asserted-by":"publisher","DOI":"10.1016\/j.trip.2021.100364","volume":"10","author":"G Krishna","year":"2021","unstructured":"Krishna, G. (2021). Understanding and identifying barriers to electric vehicle adoption through thematic analysis. Transportation Research Interdisciplinary Perspectives, 10, 100364.","journal-title":"Transportation Research Interdisciplinary Perspectives"},{"key":"9671_CR11","doi-asserted-by":"crossref","unstructured":"Kuhlman, C., VanValkenburg, M., Doherty, D., Nurbekova, M., Deva, G., Phyo, Z., Rundensteiner, E., & Harrison, L. (2018). Preference-driven interactive ranking system for personalized decision support. In Proceedings of the 27th ACM international conference on information and knowledge management (pp. 1931\u20131934).","DOI":"10.1145\/3269206.3269227"},{"issue":"3","key":"9671_CR12","doi-asserted-by":"publisher","first-page":"2762","DOI":"10.1109\/TITS.2021.3085026","volume":"23","author":"P Li","year":"2021","unstructured":"Li, P., Wang, X., Gao, H., Xiaolong, X., Iqbal, M., & Dahal, K. (2021). A dynamic and scalable user-centric route planning algorithm based on polychromatic sets theory. IEEE Transactions on Intelligent Transportation Systems, 23(3), 2762\u20132772.","journal-title":"IEEE Transactions on Intelligent Transportation Systems"},{"key":"9671_CR13","doi-asserted-by":"crossref","unstructured":"Lowd, D., & Meek, C. (2005). Adversarial learning. In Proceedings of the eleventh ACM SIGKDD international conference on Knowledge discovery in data mining (pp. 641\u2013647).","DOI":"10.1145\/1081870.1081950"},{"key":"9671_CR14","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1016\/j.trpro.2021.11.009","volume":"58","author":"J\u00c1 Mart\u00edn-Baos","year":"2021","unstructured":"Mart\u00edn-Baos, J. \u00c1., Garc\u00eda-R\u00f3denas, R., & Rodriguez-Benitez, L. (2021). A python package for performing penalized maximum likelihood estimation of conditional logit models using kernel logistic regression. Transportation Research Procedia, 58, 61\u201368.","journal-title":"Transportation Research Procedia"},{"key":"9671_CR15","unstructured":"McPhie, T. EU deal to end sale of new CO2 emitting cars by 2035."},{"issue":"6","key":"9671_CR16","doi-asserted-by":"publisher","first-page":"275","DOI":"10.1002\/cem.873","volume":"18","author":"AJ Myles","year":"2004","unstructured":"Myles, A. J., Feudale, R. N., Liu, Y., Woody, N. A., & Brown, S. D. (2004). An introduction to decision tree modeling. Journal of Chemometrics: A Journal of the Chemometrics Society, 18(6), 275\u2013285.","journal-title":"Journal of Chemometrics: A Journal of the Chemometrics Society"},{"key":"9671_CR17","unstructured":"Pippa Crerar, K.\u00a0S., & Harvey, F. (2023). Rishi Sunak announces u-turn on key green targets."},{"issue":"2","key":"9671_CR18","first-page":"1","volume":"10","author":"R Pradhan","year":"2022","unstructured":"Pradhan, R., Agarwal, A., & De, T. (2022). A multi-criteria route selection method for vehicles using genetic algorithms based on driver\u00e2\u20ac\u2122s preference. Wireless Personal Communications, 10(2), 1\u201320.","journal-title":"Wireless Personal Communications"},{"key":"9671_CR19","unstructured":"Shafipour\u00a0Yourdshahi, E., & Stein, S. (2022). Electric vehicle charging on long journeys: Current challenges and future opportunities."},{"key":"9671_CR20","doi-asserted-by":"crossref","unstructured":"Shafipour\u00a0Yourdshahi, E., Stein, S., & Ahipasaoglu, S. (2023). Personalised electric vehicle routing using online estimators. In ECAI 2023 workshops, Krak\u00f3w, Poland (in Press).","DOI":"10.21203\/rs.3.rs-3412792\/v1"},{"key":"9671_CR21","doi-asserted-by":"crossref","unstructured":"Small, K. A. (1987). A discrete choice model for ordered alternatives. Econometrica: Journal of the Econometric Society, 55, 409\u2013424.","DOI":"10.2307\/1913243"},{"key":"9671_CR22","doi-asserted-by":"crossref","unstructured":"Tiausas, F., Talusan, J.\u00a0P., Ishimaki, Y., Yamana, H., Yamaguchi, H., Bhattacharjee, S., Dubey, A., Yasumoto, K., & Das, S.\u00a0K. (2021). User-centric distributed route planning in smart cities based on multi-objective optimization. In 2021 IEEE international conference on smart computing (SMARTCOMP) (pp. 77\u201382). IEEE.","DOI":"10.1109\/SMARTCOMP52413.2021.00031"},{"key":"9671_CR23","unstructured":"Toffano, F., Viappiani, P., & Wilson, N. (2021). Efficient exact computation of setwise minimax regret for interactive preference elicitation."},{"key":"9671_CR24","unstructured":"UK\u00a0Department for Transport. Electric vehicle charging research (2022)."},{"issue":"3","key":"9671_CR25","first-page":"729","volume":"12","author":"MA Wiering","year":"2012","unstructured":"Wiering, M. A., & Van Otterlo, M. (2012). Reinforcement learning. Adaptation, learning, and optimization, 12(3), 729.","journal-title":"Adaptation, learning, and optimization"},{"key":"9671_CR26","unstructured":"Xu, P., & Gu, Q. (2020). A finite-time analysis of q-learning with neural network function approximation. In International conference on machine learning (pp. 10555\u201310565). PMLR."}],"container-title":["Autonomous Agents and Multi-Agent Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10458-024-09671-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10458-024-09671-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10458-024-09671-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,11,13]],"date-time":"2024-11-13T10:24:59Z","timestamp":1731493499000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10458-024-09671-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,9,30]]},"references-count":26,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2024,12]]}},"alternative-id":["9671"],"URL":"https:\/\/doi.org\/10.1007\/s10458-024-09671-8","relation":{"has-preprint":[{"id-type":"doi","id":"10.21203\/rs.3.rs-3412792\/v1","asserted-by":"object"}]},"ISSN":["1387-2532","1573-7454"],"issn-type":[{"value":"1387-2532","type":"print"},{"value":"1573-7454","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,9,30]]},"assertion":[{"value":"7 August 2024","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"30 September 2024","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}],"article-number":"45"}}