• Journal of Astronomy and Space Sciences
• /
• 제21권3호
• /
• pp.209-220
• /
• 2004

Some methods have been presented to get optimal formation trajectories in the step of configuration or reconfiguration, which subject to constraints of collision avoidance and final configuration. In this study, a method for optimal formation trajectory-planning is introduced in view of fuel/time minimization using parameter optimization technique which has not been applied to optimal trajectory-planning for satellite formation flying. New constraints of nonlinear equality are derived for final configuration and constraints of nonlinear inequality are used for collision avoidance. The final configuration constraints are that three or more satellites should be placed in an equilateral polygon of the circular horizontal plane orbit. Several examples are given to get optimal trajectories based on the parameter optimization problem which subjects to constraints of collision avoidance and final configuration. They show that the introduced method for trajectory-planning is well suited to trajectory design problems of formation flying missions.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 2000년도 제15차 학술회의논문집
• /
• pp.255-255
• /
• 2000

Technical advance of electrical chart and cruising equipment make it possible to sail without a man. It is important to decide the cruising route in view of effectiveness and stability of a ship. So we need to study on the optimal trajectory planning. Genetic algorithm is a strong optimization algorithm with adaptational random search. It is a good choice to apply genetic algorithm to the trajectory planning of a ship. We modify a genetic algorithm to solve this problem. The effectiveness of the revised genetic algorithm is assured through computer simulations.

• Journal of Construction Engineering and Project Management
• /
• 제2권1호
• /
• pp.35-44
• /
• 2012

In the last two decades, several tele-operated and machine-vision-assisted systems have been developed in the construction and maintenance area, such as pavement crack sealing, sewer pipe rehabilitation, and excavation. In developing such tele-operated and machine-vision-assisted systems, trajectory plans are very important tasks for the optimal motions of robots whether their environments are structured or unstructured. This paper presents an optimal trajectory planning algorithm used for a machine-vision-assisted automatic pavement crack sealing system. In this paper, the performance of the proposed optimal trajectory planning algorithm is compared with the greedy trajectory plans, which are used in the previously developed pavement crack sealing systems. The comparison is based on the computational cost vs. the overall gains in crack sealing efficiency. Finally, it is concluded that the proposed algorithm plays an important role in the productivity improvement of the developed automatic pavement crack sealing system.

• Journal of Mechanical Science and Technology
• /
• 제19권spc1호
• /
• pp.452-460
• /
• 2005

Based on an introduced optimal trajectory planning method, this paper mainly deals with the accuracy analysis during the function approximation process of the optimal trajectory planning method. The basis functions are composed of Hermit polynomials and Fourier series to improve the approximation accuracy. Since the approximation accuracy is affected by the given orders of each basis function, the accuracy of the optimal solution is examined by changing the combinations of the orders of Hermit polynomials and Fourier series as the approximation basis functions. As a result, it is found that the proper approximation basis functions are the $5^{th}$ order Hermit polynomials and the $7^{th}-10^{th}$ order of Fourier series.

• International Journal of Control, Automation, and Systems
• /
• 제4권1호
• /
• pp.10-16
• /
• 2006

In this paper, moving a fragile object from an initial point to a specific location in the minimum time without damage is studied. In order to achieve this goal, initially, the maximum acceleration and velocity ranges are specified. These ranges can be dynamically generate on the planned path by the manipulator. The path can be altered by considering the geometrical constraints. Later, considering the impulsive force constraint on the object, the range of maximum acceleration and velocity are obtained to preserve object safety while the manipulator is carrying it along the curved path. Finally, a time-optimal trajectory is planned within the maximum allowable range of acceleration and velocity. This time-optimal trajectory planning can be applied to real applications and is suitable for both continuous and discrete paths.

• 제어로봇시스템학회논문지
• /
• 제18권9호
• /
• pp.845-853
• /
• 2012

We propose time-optimal cornering motion trajectory planning and control algorithms for differential wheeled mobile robot with motor actuating voltage constraint, under piecewise constant control input condition. For time-optimal cornering trajectory generation, 1) we considered mobile robot's dynamics including actuator motors, 2) divided the cornering trajectory into one liner section, followed by two cornering section with angular acceleration and deceleration, and finally one liner section, and 3) formulated an efficient trajectory generation algorithm satisfying the bang-bang control principle. Also we proposed an efficient trajectory control algorithm and implemented with an X-bot to prove the performance.

• 제어로봇시스템학회논문지
• /
• 제10권8호
• /
• pp.696-702
• /
• 2004

An optimal trajectory generation algorithm for capturing a moving object by a mobile robot in real-time is proposed in this paper. The linear and rotational velocities of the moving object are estimated using the Kalman filter, as a state estimator. For the estimation, the moving object is tracked by a 2-DOF active camera mounted on the mobile robot, which enables a mobile manipulator to track the mobile robot until the capturing moment. The optimal trajectory for capturing the moving object is dependent on the initial conditions of the mobile robot as well as the moving object. Therefore, real-time trajectory planning for the mobile robot is definitely required for the successful capturing of the moving object. The performance of proposed algorithm is verified through the real experiments and the superiority is demonstrated by comparing to other algorithms.

• 한국해양공학회지
• /
• 제37권3호
• /
• pp.122-128
• /
• 2023

Autonomous berthing is a crucial technology for autonomous ships, requiring optimal trajectory planning to prevent collisions and minimize time and control efforts. This paper presents a two-phase, two-point boundary value problem (TPBVP) strategy for creating an optimal berthing trajectory for a twin-propeller, twin-rudder ship with autonomous berthing capabilities. The process is divided into two phases: the approach and the terminal. Tunnel thruster use is limited during the approach but fully employed during the terminal phase. This strategy permits concurrent optimization of the total trajectory duration, individual phase trajectories, and phase transition time. The efficacy of the proposed method is validated through two simulations. The first explores a scenario with phase transition, and the second generates a trajectory relying solely on the approach phase. The results affirm our algorithm's effectiveness in deciding transition necessity, identifying optimal transition timing, and optimizing the trajectory accordingly. The proposed two-phase TPBVP approach holds significant implications for advancements in autonomous ship navigation, enhancing safety and efficiency in berthing operations.

• 한국정밀공학회지
• /
• 제13권6호
• /
• pp.122-127
• /
• 1996

The achievement of the optimal condition for the task of an industrial articulated robot used in many fields is an important problem to improve productivity. In this paper, a minimum-time trajectory for an articulated robot along the specified path is studied and simulated with a proper example. A general dynamic model of manipulator is represented as a function of path distance. Using this model, the velocity is produced as fast as possible at each point along the path. This minimum-time trajectory planning module together with the existing collision-free path planning modules is utilized to design the optimal path planning of robot in cases where obstacles present.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 1990년도 한국자동제어학술회의논문집(국내학술편); KOEX, Seoul; 26-27 Oct. 1990
• /
• pp.394-399
• /
• 1990

We develop an automatic trajectory planning system (ATPS) for painting robots by proposing a new trajectory planning scheme. The new scheme considers geometric modeling, painting mechanics, and robot dynamics to output an optimal trajectory (in the sense of coating thickness and painting time) based on the CAD data describing the shape of objects, The new scheme is implemented in SUN/4 workstation to develop an ATPS for painting robots. To test the validity of the new scheme and to illustrate the developed system, numerous runs are performed and analyzed.