Sciweavers

287 search results - page 28 / 58
» An Algebraic Approach to Constraint Satisfaction Problems
Sort
View
CDC
2008
IEEE
14 years 2 months ago
A Partial order approach to decentralized control
— In this paper we employ the theory of partially ordered sets to model and analyze a class of decentralized control problems. We show that posets provide a natural way of modeli...
Parikshit Shah, Pablo A. Parrilo
IROS
2009
IEEE
154views Robotics» more  IROS 2009»
14 years 2 months ago
A control-based approach to task-constrained motion planning
Abstract— We consider the problem of planning collisionfree motions for general (i.e., possibly nonholonomic) redundant robots subject to task space constraints. Previous approac...
Giuseppe Oriolo, Marilena Vendittelli
RC
2002
96views more  RC 2002»
13 years 7 months ago
Verification of Invertibility of Complicated Functions over Large Domains
A new method to decide the invertibility of a given high-dimensional function over a domain is presented. The problem arises in the field of verified solution of differential algeb...
Jens Hoefkens, Martin Berz
ESAW
2006
Springer
13 years 11 months ago
Using Constraints and Process Algebra for Specification of First-Class Agent Interaction Protocols
Abstract. Current approaches to multi-agent interaction involve specifying protocols as sets of possible interactions, and hard-coding decision mechanisms into agent programs in or...
Tim Miller, Peter McBurney
CORR
2010
Springer
129views Education» more  CORR 2010»
13 years 7 months ago
The complexity of positive first-order logic without equality
We study the complexity of evaluating positive equality-free sentences of first-order (FO) logic over a fixed, finite structure B. This may be seen as a natural generalisation of ...
Florent R. Madelaine, Barnaby Martin