Sciweavers

2294 search results - page 95 / 459
» From Path Graphs to Directed Path Graphs
Sort
View
CPM
1994
Springer
123views Combinatorics» more  CPM 1994»
15 years 1 months ago
Computing all Suboptimal Alignments in Linear Space
Recently, a new compact representation for suboptimal alignments was proposed by Naor and Brutlag (1993). The kernel of that representation is a minimal directed acyclic graph (DAG...
Kun-Mao Chao
ICRA
1994
IEEE
102views Robotics» more  ICRA 1994»
15 years 1 months ago
Sensor-Based Planning and Nonsmooth Analysis
This paper describes some initial steps towards sensor based path planning in an unknown static environment. The method is a based on a sensor-based incremental construction of a o...
Howie Choset, Joel W. Burdick
CORR
2008
Springer
138views Education» more  CORR 2008»
14 years 10 months ago
Order-Optimal Consensus through Randomized Path Averaging
Gossip algorithms have recently received significant attention, mainly because they constitute simple and robust message-passing schemes for distributed information processing over...
Florence Bénézit, Alexandros G. Dima...
AROBOTS
2006
108views more  AROBOTS 2006»
14 years 10 months ago
Relative localization using path odometry information
All mobile bases suffer from localization errors. Previous approaches to accommodate for localization errors either use external sensors such as lasers or sonars, or use internal s...
Nakju Lett Doh, Howie Choset, Wan Kyun Chung
ICRA
2010
IEEE
154views Robotics» more  ICRA 2010»
14 years 8 months ago
Multi-agent path planning with multiple tasks and distance constraints
— The DPC algorithm developed in our previous work is an efficient way of computing optimal trajectories for multiple robots in a distributed fashion with timeparameterized cons...
Subhrajit Bhattacharya, Maxim Likhachev, Vijay Kum...