Plan Merging: Experimental results

Title

Plan Merging: Experimental results

 Author

De Weerdt, M.M.
Van der Krogt, R.P.J.
Zutt, J.

Faculty

Electrical Engineering, Mathematics and Computer Science

 Department

Software Computer Technology

 Date

2003-10-23

 Abstract

In this paper we discuss the results of a plan merging algorithm. This algorithm coordinates the plans of multiple, autonomous agents, each able to independently find a plan. This algorithm is evaluated using realistic data from a taxi company. We show that when we allow passengers to be a few minutes later at their destination and share rides, we can obtain more than 5% reduction of the taxi driving distance. When we allow for a delay of 15 minutes (a common amount of time in subsidized transport) we can gain up to 30%.

 To reference this document use:

http://resolver.tudelft.nl/uuid:dc0c76cd-9cc5-4f59-91d9-7e517d515ead

 Source

BNAIC 2003: The 15th Belgium-Dutch Conference on Artificial Intelligence, Nijmegen, The Netherlands, 23-24 October 2003

 Part of collection

Institutional Repository

 Document type

conference paper

 Rights

(c) 2003 The Author(s)
Files
PDF bnaic03mathijs1.pdf 241.19 KB
Close viewer