Cart (Loading....) | Create Account
Close category search window
 

A Dynamic Pickup and Delivery Problem in Mobile Networks Under Information Constraints

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Waisanen, H.A. ; Boston Consulting Group, Dallas, TX ; Shah, D. ; Dahleh, M.A.

This paper considers a network in which a set of vehicles is responsible for picking up and delivering messages that arrive according to a Poisson process. Message pickup and delivery locations are uniformly distributed in a convex region. The vehicles are required to pickup and deliver the messages so that the average delay is minimized. It is required that the vehicle that picks up a message must be the one to deliver it. This problem is called the dynamic pickup and delivery problem (DPDP) and has applications in the context of autonomous vehicles and wireless ad hoc networks. The control policies considered are separable into two parts: an assignment policy used by a centralized controller to assign arriving messages to the vehicles for service and a service policy used by each vehicle to determine the service routes through its assigned messages. Lower bounds are provided on the delay achievable by separable control policies that depend on the information constraints in place. It is proved that the optimal average delay scaling can be reduced when message destination information is available to the centralized controller in addition to the message source information. The paper also provides policies that achieve these scaling bounds, proving that these bounds are tight.

Published in:

Automatic Control, IEEE Transactions on  (Volume:53 ,  Issue: 6 )

Date of Publication:

July 2008

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.