Combining Planning and Learning of Behavior Trees for Robotic Assembly
원문 초록
Industrial robots can solve very complex tasks in controlled environments, but modern applications require robots able to operate in unpredictable surroundings as well. An increasingly popular reactive policy architecture in robotics is Behavior Trees but as with other architectures, programming time still drives cost and limits flexibility. There are two main branches of algorithms to generate policies automatically, automated planning and machine learning, both with their own drawbacks. We propose a method for generating Behavior Trees using a Genetic Programming algorithm and combining the two branches by taking the result of an automated planner and inserting it into the population. Experimental results confirm that the proposed method of combining planning and learning performs well on a variety of robotic assembly problems and outperforms both of the base methods used separately. We also show that this type of high level learning of Behavior Trees can be transferred to a real system without further training.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
The voraus-AD Dataset for Anomaly Detection in Robot Applications
Deep-Reinforcement-Learning-based Path Planning for Industrial Robots using Distance Sensors as Observation
Heuristic-free Optimization of Force-Controlled Robot Search Strategies in Stochastic Environments
You Only Demonstrate Once: Category-Level Manipulation from Single Visual Demonstration
On the Effectiveness of Iterative Learning Control
CaTGrasp: Learning Category-Level Task-Relevant Grasping in Clutter from Simulation
토론
이 논문과 연결된 포럼 글이 아직 없습니다.