1594 search results - page 106 / 319 » An Algorithm to Compute Collusion Paths |
209
click to vote
ICRA
1998
IEEE
15 years 7 months ago
1998
IEEE
This paper studies motion planning from one zero velocity state to another for a three-joint robot in a horizontal plane witha passive revolute third joint. Such a robot is small-...
114
click to vote
IROS
2009
IEEE
15 years 9 months ago
2009
IEEE
— This paper presents an approach to time-optimal kinodynamic motion planning for a mobile robot. A global path planner is used to generate collision-free straight-line paths fro...
130
click to vote
GLOBECOM
2007
IEEE
15 years 9 months ago
2007
IEEE
—In hybrid Optical/packet networks, wavelength and VLAN tag continuity along a Label Switched Path are two common constraints. These two types of constraints, referred to as Gene...
112
click to vote
TALG
2008
15 years 3 months ago
2008
The Fibonacci heap was devised to provide an especially efficient implementation of Dijkstra's shortest path algorithm. Although asyptotically efficient, it is not as fast in...
IPPS
2000
IEEE
15 years 7 months ago
2000
IEEE
In the past few years since Adleman’s pioneering work on solving the HPP(Hamiltonian Path Problem) with a DNA-based computer [1], many algorithms have been designed on solving NP...