Path planning with user route preference - A reward surface approximation approach using orthogonal Legendre polynomials

Srinivasan, AR orcid.org/0000-0001-9280-7837 and Chakraborty, S (2016) Path planning with user route preference - A reward surface approximation approach using orthogonal Legendre polynomials. In: Proceedings of 2016 IEEE International Conference on Automation Science and Engineering (CASE). 2016 IEEE International Conference on Automation Science and Engineering (CASE), 21-25 Aug 2016, Fort Worth, Texas, USA. IEEE . ISBN 978-1-5090-2409-4

Abstract

Metadata

Authors/Creators:
Copyright, Publisher and Additional Information: © 2016 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works.
Keywords: Learning (artificial intelligence) , Path planning , Databases , Markov processes , Planning , Real-time systems , Automobiles
Dates:
  • Published: August 2016
  • Accepted: 10 June 2016
  • Published (online): 17 November 2016
Institution: The University of Leeds
Academic Units: The University of Leeds > Faculty of Environment (Leeds) > Institute for Transport Studies (Leeds) > ITS: Safety and Technology (Leeds)
Depositing User: Symplectic Publications
Date Deposited: 22 Jun 2020 12:24
Last Modified: 22 Jun 2020 12:24
Status: Published
Publisher: IEEE
Identification Number: https://doi.org/10.1109/coase.2016.7743527

Share / Export

Statistics