In this work we consider a mobile robot with a laser range finder. Our goal is to find the best set of lines from the sequence of points given by a laser scan. We propose a probabi...
— A central problem in robotics is planning a collision-free path for a moving object in an environment with obstacles. Contemporary applications require a path planner that is f...
— This paper focuses on the assignment of discrete points to two robots, in the presence of geometric and kinematic constraints between the robots. The individual points have dif...
Nilanjan Chakraborty, Srinivas Akella, John T. Wen
— Robot search and rescue is a time critical task, i.e. a large terrain has to be explored by multiple robots within a short amount of time. The efficiency of exploration depend...
Alexander Kleiner, Johann Prediger, Bernhard Nebel
This paper presents the Compliant Task Generator: a new approach for the automatic conversion of a geometric path generated by a compliant path planner to a force based task specif...
Wim Meeussen, Ernesto Staffetti, Herman Bruyninckx...