• Title/Summary/Keyword: Task And Motion Planning

Search Result 49, Processing Time 0.027 seconds

Adaptability Improvement of Learning from Demonstration with Particle Swarm Optimization for Motion Planning (운동계획을 위한 입자 군집 최적화를 이용한 시범에 의한 학습의 적응성 향상)

  • Kim, Jeong-Jung;Lee, Ju-Jang
    • Journal of the Korean Society of Industry Convergence
    • /
    • v.19 no.4
    • /
    • pp.167-175
    • /
    • 2016
  • We present a method for improving adaptability of Learning from Demonstration (LfD) strategy by combining the LfD and Particle Swarm Optimization (PSO). A trajectory generated from an LfD is modified with PSO by minimizing a fitness function that considers constraints. Finally, the final trajectory is suitable for a task and adapted for constraints. The effectiveness of the method is shown with a target reaching task with a manipulator in three-dimensional space.

Minimum time path planning of robotic manipulator in drilling/spot welding tasks

  • Zhang, Qiang;Zhao, Ming-Yong
    • Journal of Computational Design and Engineering
    • /
    • v.3 no.2
    • /
    • pp.132-139
    • /
    • 2016
  • In this paper, a minimum time path planning strategy is proposed for multi points manufacturing problems in drilling/spot welding tasks. By optimizing the travelling schedule of the set points and the detailed transfer path between points, the minimum time manufacturing task is realized under fully utilizing the dynamic performance of robotic manipulator. According to the start-stop movement in drilling/spot welding task, the path planning problem can be converted into a traveling salesman problem (TSP) and a series of point to point minimum time transfer path planning problems. Cubic Hermite interpolation polynomial is used to parameterize the transfer path and then the path parameters are optimized to obtain minimum point to point transfer time. A new TSP with minimum time index is constructed by using point-point transfer time as the TSP parameter. The classical genetic algorithm (GA) is applied to obtain the optimal travelling schedule. Several minimum time drilling tasks of a 3-DOF robotic manipulator are used as examples to demonstrate the effectiveness of the proposed approach.

A Priority-based Interactive Approach to Multi-agent Motion Planning (우선 순위 기반 쌍방향 다개체 동작 계획 방법)

  • Ji, Sang-Hoon;Jung, Youn-Soo;Lee, Beom-Hee
    • The Journal of Korea Robotics Society
    • /
    • v.1 no.1
    • /
    • pp.46-57
    • /
    • 2006
  • It is well known that mathematical solutions for multi-agent planning problems are very difficult to obtain due to the complexity of mutual interactions among multi-agent. Most of the past research results thus are based on the probabilistic completeness. However, the practicality and effectiveness of the solution from the probabilistic completeness is significantly reduced by heavy computational burden. In this paper, we propose a practically applicable solution technique for multi-agent planning problems, which assures a reasonable computation time and a real world application for more than 3 multi-agents for the case of general shaped paths in agent movement. First, to reduce the computation time, a collision map is utilized for detecting potential collisions and obtaining collision-free solutions for multi-agents. Second, to minimize the maximum of multi-agent task execution time, a method is developed for selecting an optimal priority order. Simulations are finally provided for more than 20 agents to emphasize the effectiveness of the proposed interactive approach to multi-agent planning problems.

  • PDF

Real-Time Generation of Humanoid Motion with the Motion-Embedded COG Jacobian

  • Kim, Do-Ik;Choi, Young-Jin;Oh, Yong-Hwan;You, Bum-Jae
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 2005.06a
    • /
    • pp.2148-2153
    • /
    • 2005
  • For a legged robot such as a humanoid, balancing its body during a given motion is natural but the most important problem. Recently, a motion given to a humanoid is more and more complicated, and thus the balancing problem becomes much more critical. This paper suggests a real-time motion generation algorithm that guarantees a humanoid to be balanced during the motion. A desired motion of each arm and/or leg is planned by the conventional motion planning method without considering the balancing problem. In order to balance a humanoid, all the given motions are embedded into the COG Jacobian. The COG Jacobian is modified to include the desired motions and, in consequence, dimension of the COG Jacobian is drastically reduced. With the motion-embedded COG Jacobian, balancing and performing a task is completed simultaneously, without changing any other parameters related to the control or planning. Validity and efficiency of the proposed motion-embedded COG Jacobian is simulated in the paper.

  • PDF

Decentralized Motion Control of Mobile Manipulator

  • Phan, Tan-Tung;Suh, Jin-Ho;Kim, Sang-Bong
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 2003.10a
    • /
    • pp.1841-1846
    • /
    • 2003
  • The mobile platform-manipulator discussed in this paper is a three link manipulator mounted on a mobile platform. This mobile manipulator is used for welding operation and it is able to operate in a narrow space. The task of the torch, which is mounted at the end effector of the manipulator, is to track along the seam line and the task of the mobile platform is to move the origin point of the manipulator in order to go away from the singularity of the manipulator’s configuration. In this paper, the path planning for the motion of two subsystems (i.e., the manipulator and the mobile platform) was presented by the decentralized control method. Two controllers for the mobile platform and the manipulator were designed, and the relationship between the independent controllers is its state information. The simulation results are also presented to demonstrate the effectiveness of the control method.

  • PDF

How airplanes fly at power-off and full-power on rectilinear trajectories

  • Labonte, Gilles
    • Advances in aircraft and spacecraft science
    • /
    • v.7 no.1
    • /
    • pp.53-78
    • /
    • 2020
  • Automatic trajectory planning is an important task that will have to be performed by truly autonomous vehicles. The main method proposed, for unmanned airplanes to do this, consists in concatenating elementary segments of trajectories such as rectilinear, circular and helical segments. It is argued here that because these cannot be expected to all be flyable at a same constant speed, it is necessary to consider segments on which the airplane accelerates or decelerates. In order to preserve the planning advantages that result from having the speed constant, it is proposed to do all speed changes at maximum deceleration or acceleration, so that they are as brief as possible. The constraints on the load factor, the lift and the power required for the motion are derived. The equation of motion for such accelerated motions is solved numerically. New results are obtained concerning the value of the angle and the speed for which the longest distance and the longest duration glides happen, and then for which the steepest, the fastest and the most fuel economical climbs happen. The values obtained differ from those found in most airplane dynamics textbooks. Example of tables are produced that show how general speed changes can be effected efficiently; showing the time required for the changes, the horizontal distance traveled and the amount of fuel required. The results obtained apply to all internal combustion engine-propeller driven airplanes.

A Method for Local Collision-free Motion Coordination of Multiple Mobile Robots

  • Ko, Nak-Yong;Seo, Dong-Jin;Kim, Koung-Suk
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 2003.10a
    • /
    • pp.1609-1614
    • /
    • 2003
  • This paper presents a new method driving multiple robots to their goal position without collision. To consider the movement of the robots in a work area, we adopt the concept of avoidability measure. To implement the concept in collision avoidance of multiple robots, relative distance between the robots is proposed. The relative distance is a virtual distance between robots indicating the threat of collision between the robots. Based on the relative distance, the method calculates repulsive force against a robot from the other robots. Also, attractive force toward the goal position is calculated in terms of the relative distance. The proposed method is simulated for several cases. The results show that the proposed method steers robots to open space anticipating the approach of other robots. The proposed method works as a local collision-free motion coordination method in conjunction with higher level of task planning and path planning method for multiple robots to do a collaborative job.

  • PDF

Sensor-based Motion Planning Algorithm for High-rise Building Facade Cleaning of Built-in Guide Type Multi-Robot (Built-in guide 타입 다중 로봇의 고층 빌딩 외벽 청소를 위한 센서 기반 운동 계획 알고리즘)

  • Lee, Seung-Hoon;Kim, Dong-Hyung;Kang, Min-Sung;Gil, Myung-Soo;Kim, Young-Soo;Back, Sung-Hoon;Han, Chang-Soo
    • Journal of Institute of Control, Robotics and Systems
    • /
    • v.18 no.5
    • /
    • pp.445-452
    • /
    • 2012
  • With the increasing number of high-rise and large-scale buildings, modern buildings are becoming intelligent, and are incurring high construction costs and requiring careful maintenance. Maintenance works for high-rise buildings significantly depend on human labor, unlike other construction processes that are gradually being automated. The resulting accidents may produce very high social and economic losses. To address this problem, herein, this paper proposes robotic building maintenance system using multi-robot concept, in specific, cleaning a building facade which is directly subjected to minimize human labor; that improves the process efficiency and economic feasibility. The sensor for detecting contamination of building's outer-wall glass is proposed; Kalman filter was used for estimating robots' status with the contamination of the window glass. Task allocation of the sensor based multi-robots for an effective way of task execution is introduced and the feasibility was verified through the simulations.

Local Collision Avoidance of Multiple Robots Using Avoidability Measure and Relative Distance

  • Ko, Nak-Yong;Seo, Dong-Jin;Kim, Koung-Suk
    • Journal of Mechanical Science and Technology
    • /
    • v.18 no.1
    • /
    • pp.132-144
    • /
    • 2004
  • This paper presents a new method driving multiple robots to their goal position without collision. To consider the movement of the robots in a work area, we adopt the concept of avoidability measure. The avoidability measure figures the degree of how easily a robot can avoid other robots considering the velocity of the robots. To implement the concept to avoid collision among multiple robots, relative distance between the robots is proposed. The relative distance is a virtual distance between robots indicating the threat of collision between the robots. Based on the relative distance, the method calculates repulsive force against a robot from the other robots. Also, attractive force toward the goal position is calculated in terms of the relative distance. These repulsive force and attractive force are added to form the driving force for robot motion. The proposed method is simulated for several cases. The results show that the proposed method steers robots to open space anticipating the approach of other robots. In contrast, since the usual potential field method initiates avoidance motion later than the proposed method, it sometimes fails preventing collision or causes hasty motion to avoid other robots. The proposed method works as a local collision-free motion coordination method in conjunction with higher level of task planning and path planning method for multiple robots to do a collaborative job.

Route Planning and Elevator Boarding Algorithms for Last Mile Delivery Service in Multi-floor Environments (다층 환경에서의 라스트 마일 배송 서비스를 위한 경로 계획 및 엘리베이터 탑승 알고리즘)

  • Daegyu Lee;Gyuree Kang;Taejin Kim;D. Hyunchul Shim;Hoon Jung;Eunhye Kim
    • The Journal of Korea Robotics Society
    • /
    • v.18 no.1
    • /
    • pp.10-17
    • /
    • 2023
  • Recently, robots have been actively utilized for logistics and delivery services in various places such as restaurants, hotels, and hospitals. In addition, it provides a safer environment, convenience, and cost efficiency to the customers. However, when it comes to autonomous delivery in a multi-floor environment, the task is still challenging. Especially for wheeled mobile robots, it is necessary to deal with elevators to perform the last-mile delivery services. Therefore, we present a multi-floor route planning algorithm that enables a wheeled mobile robot to traverse an elevator for the delivery service. In addition, an elevator boarding mission algorithm was developed to perceive the drivable region within the elevator and generate a feasible path that is collision-free. The algorithm was tested with real-world experiments and was demonstrated to perform autonomous postal delivery service in a multi-floor building. We concluded that our study could contribute to building a stable autonomous driving robot system for a multi-floor environment.