On information invariants in robotics

Artificial Intelligence

Volumn 72, Issue 1-2, 1995, Pages 217-304

  Donald, Brace Randall ^a  

^a Department of Population Medicine and Diagnostic Sciences   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; ENVIRONMENTAL ENGINEERING; INFORMATION THEORY; SENSORS;

AUTONOMOUS AGENTS; INFORMATION INVARIANTS; TASK COMPLEXITY;

ROBOTICS;

EID: 0029211448     PISSN: 00043702     EISSN: None     Source Type: Journal    
DOI: 10.1016/0004-3702(94)00024-U     Document Type: Article

References (51)

1. On the power of the compass (or, why mazes are easier to search than graphs)
2. The complexity of elementary algebra and geometry
3. On the capability of finite automata in 2 and 3 dimensional space
4. An efficient algorithm for one-step compliant motion planning with uncertainty
5. On computability of fine motion plans
6. Planning for conjunctive goals
7. On the complexity of kinodynamic planning
8. New lower bound techniques for robot motion planning problems
9. Ideals, Varieties, and Algorithms
10. Robot motion planning
11. The complexity of planar compliant motion planning with uncertainty
12. Error detection and recovery in robotics
13. Constructive recognizability for task-directed robot programming
14. Constructive recognizability for task-directed robot programming
15. Sensor interpretation and task-directed planning using perceptual equivalence classes
16. Information invariants for distributed manipulation
17. Towards a theory of information invariants for cooperating autonomous mobile robots
18. A provably good approximation algorithm for optimal-time trajectory planning
19. Provably good approximation algorithms for optimal kinodynamic planning for cartesian robots and open chain manipulators
20. Time-safety trade-offs and a bang-bang algorithm for kinodynamic planning
21. Using backprojections for fine motion planning with uncertainty
22. On probabilistic strategies for robot tasks
23. Towards task-level planning: action-based sensor design
24. An exploration of sensorless manipulation
25. Easy impossibility proofs for distributed concensus problems
26. Turing machines with restricted memory access
27. Complexity of deciding Tarski algebra
28. On the complexity of motion planning for multiple independent objects; PSPACE-hardness of the “Warehouseman's Problem”
29. Analysis of adaptation and environment
30. Active model acquisition for near-sensorless manipulation with mobile robots
31. Sensor interpretation and task-directed planning for autonomous agents
32. Automata and planar graphs, fundamentals of computing theory
33. Spatial planning a configuration space approach
34. Automatic synthesis of fine-motion strategies for robots
35. Path-planning strategies for a point mobile automaton moving amidst unknown obstacles of arbitrary shape
36. Mechanics and planning of manipulator pushing operations
37. Recursive unsolvability of Post's problem of ‘Tag’ and other topics in the theory of Turing machines
38. On planning assemblies
39. Program mobile robots in scheme
40. Complexity of the mover's problem and generalizations
41. Synthesizing information-tracking automata from environment descriptions
42. Fine motion planning for dexterous manipulation
43. Provably-good approximation algorithms for optimal kinodynamic robot plans