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...
Daniel Althoff, Matthias Althoff, Dirk Wollherr, M...
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...
Umashankar Nagarajan, George Kantor, Ralph L. Holl...
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...
Andrew Ireland, Bill J. Ellis, Andrew Cook, Roderi...
Satisfiability algorithms have become one of the most practical and successful approaches for solving a variety of real-world problems, including hardware verification, experime...
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 ...