Temporal planning (TP) is notoriously difficult because it requires to solve a propositional STRIPS planning problem with temporal constraints. In this paper, we propose an efficie...
Mobile robots must cope with uncertainty from many sources along the path from interpreting raw sensor inputs to behavior selection to execution of the resulting primitive actions...
Peter Stone, Mohan Sridharan, Daniel Stronger, Gre...
— The real time flexible operation of a car-like mobile robot with nonholonomic constraints in dynamic environment is still a very challenging problem. The difficulty lies in t...
This paper focuses on the protection of virtual circuits (Label Switched Paths, LSPs) in a (G)MPLS (Generalised Multi-Protocol Label Switching) network. The proposed algorithm is ...
ABSTRACT. Estimating a non-uniformly sampled function from a set of learning points is a classical regression problem. Kernel methods have been widely used in this context, but eve...