Towards autonomy:Cost-effective scheduling for long-range autonomous valet parking (LAVP)

Khalid, Muhammad, Cao, Yue, Zhang, Xu ORCID: https://orcid.org/0000-0001-6557-6607, Han, Chong, Peng, Linyu, Aslam, Nauman and Ahmad, Naveed (2018) Towards autonomy:Cost-effective scheduling for long-range autonomous valet parking (LAVP). In: 2018 IEEE Wireless Communications and Networking Conference, WCNC 2018. IEEE Wireless Communications and Networking Conference, WCNC . The Institute of Electrical and Electronics Engineers (IEEE), ESP, pp. 1-6. ISBN 9781538617342

Full text not available from this repository. (Request a copy)

Abstract

Continuous and effective developments in Autonomous Vehicles (AVs) are happening on daily basis. Industries nowadays, are interested in introducing less costly and highly controllable AVs to public. Current so-called AVP solutions are still limited to a very short range (e.g., even only work at the entrance of car parks). This paper proposes a parking scheduling scheme for long-range AVP (LAVP) case, by considering mobility of Autonomous Vehicles (AVs), fuel consumption and journey time. In LAVP, Car Parks (CPs) are used to accommodate increasing numbers of AVs, and placed outside city center, in order to avoid traffic congestions and ensure road safety in public places. Furthermore, with positioning of reference points to guide user-centric long-term driving and drop-off/pick-up passengers, simulation results under the Helsinki city scenario shows the benefits of LAVP. The advantage of LAVP system is also reflected through both analysis and simulation.

Item Type: Book Section
Additional Information: Publisher Copyright: © 2018 IEEE.
Uncontrolled Keywords: engineering(all) ,/dk/atira/pure/subjectarea/asjc/2200
Faculty \ School: Faculty of Science > School of Computing Sciences
Related URLs:
Depositing User: LivePure Connector
Date Deposited: 26 Jan 2024 02:20
Last Modified: 30 Jan 2024 04:03
URI: https://ueaeprints.uea.ac.uk/id/eprint/94273
DOI: 10.1109/WCNC.2018.8377313

Actions (login required)

View Item View Item