1021 search results - page 60 / 205 » Concepts in Proof Planning |
ICRA
2010
IEEE
13 years 7 months ago
2010
IEEE
Abstract— For path planning algorithms of robots it is important that the robot does not reach a state of inevitable collision. In crowded environments with many humans or robots...
CDC
2010
IEEE
13 years 3 months ago
2010
IEEE
This paper presents a hybrid control strategy for navigation of shape-accelerated underactuated balancing systems with dynamic constraints. It extends the concept of sequential com...
JAR
2006
13 years 8 months ago
2006
Using automated reasoning techniques, we tackle the niche activity of proving that a program is free from run-time exceptions. Such a property is particularly valuable in high inte...
ECCC
2007
13 years 8 months ago
2007
Satisfiability algorithms have become one of the most practical and successful approaches for solving a variety of real-world problems, including hardware verification, experime...
NDJFL
2000
13 years 8 months ago
2000
In this paper, we explore Fregean metatheory, what Frege called the New Science. The New Science arises in the context of Frege's debate with Hilbert over independence proofs ...