Sciweavers

315 search results - page 1 / 63
» Shortest path optimization under limited information
Sort
View
CDC
2009
IEEE
151views Control Systems» more  CDC 2009»
14 years 3 months ago
Shortest path optimization under limited information
— The problem of finding an optimal path in an uncertain graph arises in numerous applications, including network routing, path-planning for vehicles, and the control of finite...
Michael Rinehart, Munther A. Dahleh

Publication
2630views
15 years 10 months ago
DIJKSTRA’S and Fast Marching Method for Optimal Path Planning
This technical report illustrates the differences in solving the optimal path problem (shortest path) using different methods, where the underlying PDE can be described by the eik...
RYO TAKEI
SLS
2009
Springer
250views Algorithms» more  SLS 2009»
14 years 5 months ago
Running Time Analysis of ACO Systems for Shortest Path Problems
Ant Colony Optimization (ACO) is inspired by the ability of ant colonies to find shortest paths between their nest and a food source. We analyze the running time of different ACO...
Christian Horoba, Dirk Sudholt
INFOCOM
2009
IEEE
14 years 5 months ago
On Combining Shortest-Path and Back-Pressure Routing Over Multihop Wireless Networks
Abstract—Back-pressure based algorithms based on the algorithm by Tassiulas and Ephremides have recently received much attention for jointly routing and scheduling over multihop ...
Lei Ying, Sanjay Shakkottai, Aneesh Reddy
GLOBECOM
2009
IEEE
13 years 9 months ago
Minimum-Length Scheduling for Multicast Traffic under Channel Uncertainty
Abstract--We consider a set of multicast sources, each multicasting a finite amount of data to its corresponding destinations. The objective is to minimize the time to deliver all ...
Anna Pantelidou, Anthony Ephremides