Pawel Zylinski

Learn More
Consider the following survival problem:Given a set of k trajectories (paths) with maximum unit speed in a boundedregion over a (long) time interval [0,T], find another trajectory (if itexists) subject to the same maximum unit speed limit, that avoids (that is, stays at a safe distance of)each of the other trajectories over the entire time interval. We call(More)
Consider the following safe path planning problem: Given a set of trajectories (paths) of k point robots with maximum unit speed in a bounded region over a (long) time interval [0, T ], find another trajectory (if it exists) subject to the same maximum unit speed limit, that avoids (that is, stays at a safe distance of) each of the other k trajectories over(More)