منابع مشابه
Time and Space Bounds for Planning
There is an extensive literature on the complexity of planning, but explicit bounds on time and space complexity are very rare. On the other hand, problems like the constraint satisfaction problem (CSP) have been thoroughly analysed in this respect. We provide a number of upperand lower-bound results (the latter based on various complexitytheoretic assumptions such as the Exponential Time Hypot...
متن کاملTime and Space Bounds for Reversible Simulation
We prove a general upper bound on the trade-off between time and space that suffices for the reversible simulation of irreversible computation. Previously, only simulations using exponential time or quadratic space were known. The trade-off shows for the first time that we can simultaneously achieve subexponential time and subquadratic space. The boundary values are the exponential time with ha...
متن کاملConditional Lower Bounds for Space/Time Tradeoffs
In recent years much effort has been concentrated towards achieving polynomial time lower bounds on algorithms for solving various well-known problems. A useful technique for showing such lower bounds is to prove them conditionally based on well-studied hardness assumptions such as 3SUM, APSP, SETH, etc. This line of research helps to obtain a better understanding of the complexity inside P. A ...
متن کاملSpace-Time Bounds for Collision Detection
Collision detection and response is an important but costly component of computer animation. We identify three basic reasons why collision-detection algorithms can be slow. We present a new collision-detection algorithm that directly addresses two of these problems and that prepares us for future work on the third. Our algorithm is based on a four-dimensional structure that puts a conservative ...
متن کاملSpace-Time Group Motion Planning
We present a novel approach for planning and directing heterogeneous groups of virtual agents based on techniques from linear programming. Our method efficiently identifies the most promising paths in both time and space and provides an optimal distribution of the groups’ members over these paths such that their average traveling time is minimized. The computed space-time plan is combined with ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Artificial Intelligence Research
سال: 2017
ISSN: 1076-9757
DOI: 10.1613/jair.5535