See this document in CiteSeerX!

Continuous Alternation:  (Make Corrections)  
The Complexity of Pursuit in Continuous Domains John H. Reif Stephen R. Tate...



  Home/Search   Context   Related

 
View or download:
unt.edu/~srt/papers/pursuit.ps
Cached:  PS.gz  PS  PDF   Image  Update  Help

From:  unt.edu/~srt/papers/ (more)
(Enter author homepages)

Rate this article: (best)
  Comment on this article  
(Enter summary)

Abstract: Complexity theory has used a game theoretic notion, namely alternation, to great advantage in modeling parallelism and in obtaining lower bounds. The usual definition of alternation requires that transitions be made in discrete steps. The study of differential games is a classic area of optimal control, where there is continuous interaction and alternation between the players. (Update)

Similar documents (at the sentence level):
55.9%:   Arithmetic Circuit Complexity and Motion Planning - Tate (1992)   (Correct)

Active bibliography (related documents):   More   All
1.6:   Continuous Alternation: The Complexity of Pursuit in Continuous .. - Reif, Tate (1993)   (Correct)
0.5:   Provably Good Approximation Algorithms for Optimal.. - Donald, Xavier (1995)   (Correct)
0.4:   Provably Good Approximation Algorithms for Optimal.. - Donald, Xavier (1995)   (Correct)

Similar documents based on text:
0.0:   Unknown -   (Correct)

BibTeX entry:   (Update)

@misc{ of-continuous,
  author = "The Complexity Of",
  title = "Continuous Alternation:",
  url = "citeseer.ist.psu.edu/762926.html" }
Citations (may not include all citations):
133   Quantifier Elimination for Real Closed Fields by Cylindric A.. (context) - Collins - 1975
124   Journal of the ACM (context) - Chandra, Kozen et al. - 1981
113   New Lower Bound Techniques for Robot Motion Planning Problem.. (context) - Canny, Reif - 1987
110   the Computational Complexity and Geometry of the First-order.. (context) - Renegar - 1989
90   Complexity of the Mover's Problem and Generalizations (context) - Reif - 1979
86   Provably Good Approximation Algorithms for Optimal Kinodynam.. - Donald, Xavier - 1990
86   A Provably Good Approximation Algorithm for Optimal-Time Tra.. - Donald, Xavier - 1989
79   Motion Planning in the Presence of Moving Obstacles - Reif, Sharir - 1985
57   Some Algebraic and Geometric Computations in PSPACE (context) - Canny - 1988
46   Approximation Algorithms for Shortest Path Motion Planning - Clarkson - 1987
41   An Algorithm for Shortest-Path Motion in Three Dimensions (context) - Papadimitriou - 1985
41   An Exact Algorithm for Kinodynamic Planning in the Plane (context) - Canny, Rege et al. - 1990
33   Planning of Minimum-Time Trajectories for Robot Arms - Sahar, Hollerbach - 1985
31   An Algorithm for Planning Collision-free Paths Among Polyhed.. (context) - Lozano-Perez, Wesley - 1979
27   The Complexity of Kinodynamic Planning (context) - Canny, Donald et al. - 1988
22   Hemisphere Publishing Corporation (context) - Bryson, Ho et al. - 1975
21   Dynamic Scaling of Manipulator Trajectories - Hollerbach - 1983
12   Planning Guaranteed Near Time-Optimal Trajectories for a Man.. (context) - Jacobs, Heinzinger et al. - 1989
11   The Complexity of Planar Compliant Motion Planning Under Unc.. (context) - Donald - 1988
11   Approximate Kinodynamic Planning Using L 2 -norm Dynamics Bo.. - Reif, Tate - 1990
9   Minimizing Turns for Discrete Movement in the Interior of a .. (context) - Reif, Storer - 1987
4   the Optimality of Bang-Bang Trajectories in R (context) - Schaettler
4   Motion Planning with Inertial Constraints (context) - 'OD'unlaing - 1987
3   A Survey on Advances in the Theory of Computational Robotics (context) - Reif - 1986
3   Optimal Control of Robotic Manipulators (context) - Bobrow - 1982

Documents on the same site (http://www.cse.unt.edu/~srt/papers/):   More
Searching in an Unknown Environment: An Optimal Randomized.. - Kao, Reif, Tate (1993)   (Correct)
Band Ordering in Lossless Compression of Multispectral Images - Tate (1994)   (Correct)
Stable Computation of the Complex Roots of Unity - Stephen Tate Department   (Correct)

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC