A planning problem is time-dependent, if the time spent planning affects the utility of the system's performance. In [Dean and Boddy, 1988], we define a framework for constru...
We investigate the feasibility of reconstructing an arbitrarily-shaped specular scene (refractive or mirror-like) from one or more viewpoints. By reducing shape recovery to the pr...
This paper proposes a novel method for detecting nonconforming trajectories of objects as they pass through a scene. Existing methods mostly use spatial features to solve this pro...
We describe a deterministic, polynomial time algorithm for finding edge-disjoint paths connecting given pairs of vertices in an expander. Specifically, the input of the algorith...
— In this paper, a path planning and its evaluation method is described with taking into account wheel slip dynamics of lunar/planetary exploration rovers. The surface of the pla...