Sciweavers

2996 search results - page 370 / 600
» Dynamic Traveling Repairperson Problem for dynamic systems
Sort
View
COMPGEOM
2008
ACM
15 years 8 months ago
Routing a maximum number of disks through a scene of moving obstacles
This video illustrates an algorithm for computing a maximum number of disjoint paths for unit disks moving among a set of dynamic obstacles in the plane. The problem is motivated ...
Joondong Kim, Joseph S. B. Mitchell, Valentin Poli...
AUTOMATICA
2007
124views more  AUTOMATICA 2007»
15 years 6 months ago
Motion planning in uncertain environments with vision-like sensors
In this work we present a methodology for intelligent path planning in an uncertain environment using vision like sensors, i.e., sensors that allow the sensing of the environment ...
Suman Chakravorty, John L. Junkins
167
Voted
IJHPCA
2006
109views more  IJHPCA 2006»
15 years 6 months ago
A Resource Leasing Policy for on-Demand Computing
Leasing computational resources for on-demand computing is now a viable option for providers of network services. Temporary spikes or lulls in demand for a service can be accommod...
Darin England, Jon B. Weissman
RAS
2006
111views more  RAS 2006»
15 years 6 months ago
Planning under uncertainty using model predictive control for information gathering
This paper considers trajectory planning problems for autonomous robots in information gathering tasks. The objective of the planning is to maximize the information gathered withi...
Cindy Leung, Shoudong Huang, Ngai Ming Kwok, Gamin...
ICRA
2010
IEEE
148views Robotics» more  ICRA 2010»
15 years 4 months ago
Global reachability and path planning for planetary exploration with montgolfiere balloons
Aerial vehicles are appealing systems for possible future exploration of planets and moons such as Venus and Titan, because they combine extensive coverage with highresolution data...
Lars Blackmore, Yoshiaki Kuwata, Michael T. Wolf, ...