Online scheduling of a fleet of autonomous vehicles using agent-based procurement auctions

Meghana Madhyastha, Sriveda Chevuru Reddy, Shrisha Rao
{"title":"Online scheduling of a fleet of autonomous vehicles using agent-based procurement auctions","authors":"Meghana Madhyastha, Sriveda Chevuru Reddy, Shrisha Rao","doi":"10.1109/SOLI.2017.8120980","DOIUrl":null,"url":null,"abstract":"We propose a novel distributed approach for the problem of scheduling a fleet of autonomous vehicles. Our distributed system avoids a single point of failure, is scalable, fault tolerant and robust. We describe an agent-based distributed system to conduct a set of procurement auctions. The vehicles are the “sellers” and the passengers are the “buyers” in the auction. Each vehicle bids for the passengers with a bid value which is an inverse function of the time it would take the vehicle to reach the passenger. In our agent based architecture, the various software agents reside on different systems and we describe distributed algorithms for their communication. We have performed simulations of a vehicle fleet in two different locations (Bangalore, India and Tyson's Corner, Virginia, USA) and compare the maximum and average waiting times of the passenger of our algorithm with a FIFO algorithm. We also compute the ratio of the time in which the vehicle is servicing a passenger to the total time to compute the fuel wastage. The results show that our system improves the maximum and average waiting times of the passengers, as well as the fuel costs for the vehicle fleet. Furthermore, we show that such a distributed system reduces the time it would take on average to respond to customer requests, as compared to a system which is not distributed.","PeriodicalId":190544,"journal":{"name":"2017 IEEE International Conference on Service Operations and Logistics, and Informatics (SOLI)","volume":"16 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2017-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2017 IEEE International Conference on Service Operations and Logistics, and Informatics (SOLI)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SOLI.2017.8120980","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 4

Abstract

We propose a novel distributed approach for the problem of scheduling a fleet of autonomous vehicles. Our distributed system avoids a single point of failure, is scalable, fault tolerant and robust. We describe an agent-based distributed system to conduct a set of procurement auctions. The vehicles are the “sellers” and the passengers are the “buyers” in the auction. Each vehicle bids for the passengers with a bid value which is an inverse function of the time it would take the vehicle to reach the passenger. In our agent based architecture, the various software agents reside on different systems and we describe distributed algorithms for their communication. We have performed simulations of a vehicle fleet in two different locations (Bangalore, India and Tyson's Corner, Virginia, USA) and compare the maximum and average waiting times of the passenger of our algorithm with a FIFO algorithm. We also compute the ratio of the time in which the vehicle is servicing a passenger to the total time to compute the fuel wastage. The results show that our system improves the maximum and average waiting times of the passengers, as well as the fuel costs for the vehicle fleet. Furthermore, we show that such a distributed system reduces the time it would take on average to respond to customer requests, as compared to a system which is not distributed.
使用基于代理的采购拍卖的自动驾驶车队的在线调度
我们提出了一种新的分布式方法来解决自动驾驶车队的调度问题。我们的分布式系统避免了单点故障,具有可扩展性、容错性和健壮性。我们描述了一个基于代理的分布式系统来进行一组采购拍卖。在拍卖中,车辆是“卖家”,乘客是“买家”。每辆车都为乘客出价,出价值是车辆到达乘客所需时间的反函数。在我们的基于代理的体系结构中,各种软件代理驻留在不同的系统上,我们描述了用于它们通信的分布式算法。我们在两个不同的地点(印度班加罗尔和美国弗吉尼亚州泰森角)对车队进行了模拟,并将我们的算法与FIFO算法的乘客的最大和平均等待时间进行了比较。我们还计算车辆为乘客提供服务的时间与计算燃料浪费的总时间的比率。结果表明,我们的系统改善了乘客的最长等待时间和平均等待时间,以及车队的燃料成本。此外,我们表明,与非分布式系统相比,这种分布式系统减少了响应客户请求的平均时间。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信