• Journal of Institute of Control, Robotics and Systems
• /
• v.7 no.1
• /
• pp.1187-1195
• /
• 2001

This paper presents a sweeping path planning algorithm for an autonomous smearing robot. An automatic planner generates a sweeping path pattern by proposed five basic procedures. This algorithm rocog-nizes obstacle on the architectural CAD draft and generates subgoals as tracking points which executes the area filling task based on heuristic approach. A sweeping path is planned by sequentially connecting the track-ing points in such a way that(1) the connected line segments should not be crossed, (2) the total tracking points should be as short as possible, and (3) the tracking line should not pass through the obstacle, Feasibility of the developed techniques has been demonstrated on a real architectural CAD draft.

• Proceedings of the IEEK Conference
• /
• 1998.10a
• /
• pp.417-420
• /
• 1998

A heuristic sweeping algorithm for an autonomous smearing robot which executes the area filling task is proposed. This algorithm searches tracking points with the obstacle andenvironment wall while the robot tracking whole workspace, and finds sequential tracking line by sequentally connecting the tracking points in such a way that (1) the line should be never crossed, (2) the total tracking points should be is linked as short as possible, and (3) the tracking link should be cross over the obstacle in the work-space. If the line pass through the obstacle, hierarchical collision free algorithm proposed is implied. The proposed algorithm consists of (1) collision detection procedure, (2) obstacle map making procedures, (3) tracking points generation procedures for subgosls, (4) tracking points scanning procedures, and (5) obstacle avoidance procedure.

• Proceedings of the Korean Society of Machine Tool Engineers Conference
• /
• 1999.10a
• /
• pp.539-543
• /
• 1999

This paper describes a sweeping path planning algorithm for an autonomous smearing robot on commercial autoCAD system. An automatic planner generates a sweeping path pattern by proposed five basic procedures, (1) interfacing architectural CAD system, (2) off-line obstacle map building, (3) scanning the whole workspace for subgoals of sweeping line, (4) tracking sequence of the subgoals, and (5) obstacle avoiding. A sweeping path is planned by sequentially connecting the tracking points in such a way that (1) the connected line segments should be crossed, (2) the total tracking points should be as short as possible, (3) the tracking line should not pass through the obstacle. Feasibility of the developed techniques has been demonstrated on real architectural CAD draft.