Numerous methods have been developed to solve the motion planning problem, among
which the Voronoi diagram, visibility graph, and potential fields are well‐known techniques …

A central problem of applications dealing with virtual environments is planning a collision-
free path for a character. Since environments and their characters are growing more …

We present two path planning algorithms for mobile robots that are connected by cable to a
fixed base. Our algorithms efficiently compute the shortest path and control strategy that lead …

In the last fifteen years, sampling-based planners like the Probabilistic Roadmap Method
(prm) have proved to be successful in solving complex motion planning problems. While …

The last decade, sampling based planners like the Probabilistic Roadmap Method have
proved to be successful in solving complex motion planning problems. We give a …

We present a novel motion planning algorithm that efficiently generates physics-based
samples in a kinematically and dynamically constrained space of a highly articulated chain …

Natural locomotion of virtual characters is very important in games and simulations. The
naturalness of the total motion strongly depends on both the path the character chooses and …

Cooperation among machines is deemed an essential attribute of intelligent manufacturing
and assembly systems. It improves the flexibility and reliability of such systems. The nature …

Wu and Ouyang (Production Planning & Control, Vol. 14 (2003), No. 6, pp. 555–561)
derived the integrated vendor-buyer system with shortages using algebraic method to …

Nous étudions dans ce mémoire la planification de mouvement probabiliste incrémentale.
Nos travaux se concrétisent par un nouvel algorithme de construction des arbres aléatoires …