• Title/Summary/Keyword: Workspace Planning

Search Result 65, Processing Time 0.033 seconds

Path Design Method of Mobile Robot for Obstacle Avoidance Using Ceiling- mounted Camera System and Its Implementation (천장설치형 카메라 시스템을 사용한 장애물 회피용 이동 로봇의 경로설계법과 그 구현)

  • 트란안킴;김광주;중탄람;김학경;김상봉
    • Journal of the Korean Society for Precision Engineering
    • /
    • v.21 no.8
    • /
    • pp.73-82
    • /
    • 2004
  • In this paper, implementation of obstacle avoidance of a nonholonomic mobile robot in unstructured environment is introduced. To avoid obstacles, first, a reference collision-free path for the MR is generated off-line using HJB-based optimal path planning method. A controller is designed using integrator backstepping method for tracking the generated reference path. To implement the designed controller, a control system are needed and composed of camera system and PIC-based controller. The workspace is observed by a ceiling-mounted USB camera as part of an un-calibrated camera system. Thus the positional information of the MR is updated frequently and the MR can get the useful inputs for its tracking controller. The whole control system is realized by integrating a computer with PIC-based microprocessor using wireless communication: the image processing control module and path planning module serve as high level computer control while the device control serves as low level PIC microprocessor control. The simulation and experimental results show the effectiveness of the designed control system.

Gait Planning of Quadruped Walking and Climbing Robot in Convex Corner Environment

  • Loc, Vo Gia;Kang, Tae-Hun;Song, Hyun-Sup;Choi, Hyouk-Ryeol
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 2005.06a
    • /
    • pp.314-319
    • /
    • 2005
  • When a robot navigates in the real environment, it frequently meets various environments that can be expressed by simple geometrical shapes such as fiat floor, uneven floor, floor with obstacles, slopes, concave or convex corners, etc. Among them, the convex corner composed of two plain surfaces is the most difficult one for the robot to negotiate. In this paper, we propose a gait planning algorithm to help the robot overcome the convex environment. The trajectory of the body is derived from the maximum distance between the edge boundary of the corner and the bottom of the robot when it travels in the convex environment. Additionally, we find the relation between kinematical structure of the robot and its ability of avoiding collision. The relation is realized by considering the workspace and the best posture of the robot in the convex structure. To provide necessary information for the algorithm, we use an IR sensor attached in the leg of the robot to perceive the convex environment. The validity of the gait planning algorithm is verified through simulations and the performance is demonstrated using a quadruped walking robot, called "MRWALLSPECT III"( Multifunctional Robot for WALL inSPECTion version 3).

  • PDF

A collision-free path planning using linear parametric curve based on geometry mapping of obstacles (장애물의 기하투영에 의한 일차매개곡선을 이용한 충돌회피 경로계획)

  • Nam-Gung, In
    • Transactions of the Korean Society of Mechanical Engineers A
    • /
    • v.21 no.12
    • /
    • pp.1992-2007
    • /
    • 1997
  • A new algorithm for planning a collision-free path is developed based on linear prametric curve. In this paper robot is assumed to a point, and two linear parametric curve is used to construct a path connecting start and goal point, in which single intermediate connection point between start and goal point is considered. The intermediate connection point is set in polar coordinate(${\theta}{\delta}$) , and the interference between path and obstacle is mapped into CPS(connection point space), which is defined a CWS GM(circular work space geometry mapping). GM of all obstacles in workspace creates overlapping images of obstacle in CPS(Connection Point Space). The GM for all obstacles produces overlapping images of obstacle in CPS. The empty area of CPS that is not occupied by obstacle images represents collision-free paths in Euclidian Space. A GM based on connection point in elliptic coordinate(${\theta}{\delta}$) is also developed in that the total length of path is depend only on the variable .delta.. Hence in EWS GM(elliptic work space geometry mapping), increasing .delta. and finding the value of .delta. for collision-free path, the shortest path can be searched without carring out whole GM. The GM of obstacles expersses all possible collision-free path as empty spaces in CPS. If there is no empty space available in CPS, it indicates that path planning is not possible with given number of connection points, i.e. path planning is failed, and it is necessary to increase the number of connection point. A general case collision-free path planning is possible by appling GM to configuration space obstacles. Simulation of GM of obstacles in Euclidian space is carried out to measure performance of algorithm and the resulting obstacle images are reported.

Multi-day Trip Planning System with Collaborative Recommendation (협업적 추천 기반의 여행 계획 시스템)

  • Aprilia, Priska;Oh, Kyeong-Jin;Hong, Myung-Duk;Ga, Myeong-Hyeon;Jo, Geun-Sik
    • Journal of Intelligence and Information Systems
    • /
    • v.22 no.1
    • /
    • pp.159-185
    • /
    • 2016
  • Planning a multi-day trip is a complex, yet time-consuming task. It usually starts with selecting a list of points of interest (POIs) worth visiting and then arranging them into an itinerary, taking into consideration various constraints and preferences. When choosing POIs to visit, one might ask friends to suggest them, search for information on the Web, or seek advice from travel agents; however, those options have their limitations. First, the knowledge of friends is limited to the places they have visited. Second, the tourism information on the internet may be vast, but at the same time, might cause one to invest a lot of time reading and filtering the information. Lastly, travel agents might be biased towards providers of certain travel products when suggesting itineraries. In recent years, many researchers have tried to deal with the huge amount of tourism information available on the internet. They explored the wisdom of the crowd through overwhelming images shared by people on social media sites. Furthermore, trip planning problems are usually formulated as 'Tourist Trip Design Problems', and are solved using various search algorithms with heuristics. Various recommendation systems with various techniques have been set up to cope with the overwhelming tourism information available on the internet. Prediction models of recommendation systems are typically built using a large dataset. However, sometimes such a dataset is not always available. For other models, especially those that require input from people, human computation has emerged as a powerful and inexpensive approach. This study proposes CYTRIP (Crowdsource Your TRIP), a multi-day trip itinerary planning system that draws on the collective intelligence of contributors in recommending POIs. In order to enable the crowd to collaboratively recommend POIs to users, CYTRIP provides a shared workspace. In the shared workspace, the crowd can recommend as many POIs to as many requesters as they can, and they can also vote on the POIs recommended by other people when they find them interesting. In CYTRIP, anyone can make a contribution by recommending POIs to requesters based on requesters' specified preferences. CYTRIP takes input on the recommended POIs to build a multi-day trip itinerary taking into account the user's preferences, the various time constraints, and the locations. The input then becomes a multi-day trip planning problem that is formulated in Planning Domain Definition Language 3 (PDDL3). A sequence of actions formulated in a domain file is used to achieve the goals in the planning problem, which are the recommended POIs to be visited. The multi-day trip planning problem is a highly constrained problem. Sometimes, it is not feasible to visit all the recommended POIs with the limited resources available, such as the time the user can spend. In order to cope with an unachievable goal that can result in no solution for the other goals, CYTRIP selects a set of feasible POIs prior to the planning process. The planning problem is created for the selected POIs and fed into the planner. The solution returned by the planner is then parsed into a multi-day trip itinerary and displayed to the user on a map. The proposed system is implemented as a web-based application built using PHP on a CodeIgniter Web Framework. In order to evaluate the proposed system, an online experiment was conducted. From the online experiment, results show that with the help of the contributors, CYTRIP can plan and generate a multi-day trip itinerary that is tailored to the users' preferences and bound by their constraints, such as location or time constraints. The contributors also find that CYTRIP is a useful tool for collecting POIs from the crowd and planning a multi-day trip.

Optimal Path Planner Considering Real Terrain for Fixed-Wing UAVs (실제지형을 고려한 고정익 무인항공기의 최적 경로계획)

  • Lee, Dasol;Shim, David Hyunchul
    • Journal of Institute of Control, Robotics and Systems
    • /
    • v.20 no.12
    • /
    • pp.1272-1277
    • /
    • 2014
  • This article describes a path planning algorithm for fixed-wing UAVs when a real terrain should be considered. Nowadays, many UAVs are required to perform mission flights near given terrain for surveillance, reconnaissance, and infiltration, as well as flight altitude of many UAVs are relatively lower than typical manned aerial vehicles. Therefore, real terrain should be considered in path planning algorithms of fixed-wing UAVs. In this research, we have extended a spline-$RRT^*$ algorithm to three-dimensional planner. The spline-$RRT^*$ algorithm is a $RRT^*$ based algorithm, and it takes spline method to extend the tree structure over the workspace to generate smooth paths without any post-processing. Direction continuity of the resulting path is guaranteed via this spline technique, and it is essential factor for the paths of fixed-wing UAVs. The proposed algorithm confirm collision check during the tree structure extension, so that generated path is both geometrically and dynamically feasible in addition to direction continuity. To decrease degrees of freedom of a random configuration, we designed a function assigning directions to nodes of the graph. As a result, it increases the execution speed of the algorithm efficiently. In order to investigate the performance of the proposed planning algorithm, several simulations are performed under real terrain environment. Simulation results show that this proposed algorithm can be utilized effectively to path planning applications considering real terrain.

A Study on the Obstacle Avoidance of a Robot Manipulator by Using the Neural Optimization Network (신경최적화 회로를 이용한 로봇의 장애물 회피에 관한 연구)

  • 조용재;정낙영;한창수
    • Transactions of the Korean Society of Mechanical Engineers
    • /
    • v.17 no.2
    • /
    • pp.267-276
    • /
    • 1993
  • This paper discusses the neural network application in the study on the obstacle avoidance of robot manipulator during the trajectory planning. The collision problem of two robot manipulators which are simultaneously moving in the same workspace is investigated. Instead of the traditional modeling method, this paper processing based on the calculation of joint angle in the cartesian coordinate with constrained condition shows the possibility of real time control. The problem of the falling into the local minima is cleared by the adaptive weight factor control using the temperature adding method. Computer simulations are shown for the verification.

Development of a Reflective Collaborative Work System for e-Learning Contents Development (e-Learning 콘텐츠 개발을 위한 성찰적 협력작업시스템 개발)

  • Cho Eun-Soon;Kim In-Sook
    • The Journal of the Korea Contents Association
    • /
    • v.6 no.3
    • /
    • pp.108-115
    • /
    • 2006
  • e-Learning contents are composed of compounding multimedia data. It requires many professionals in contents development stage. The process of e-learning contents development can be seen as a collaborative work. In the perspective of a collaborative work process, the whole process of e-learning contents development would be regarded as collaborative work process for each participant as well as for whole group members. Most of collaborative works in contents development field are widely distributed. Members of work groups require workspaces for sharing information and communicating each other. In addition to workspaces, it also needs to support collaborative reflection such as planning for collaborative work and monitoring for work process. This paper is intended to develop the reflective collaborative work system for e-Learning contents development in order to support the systemic process of e-learning contents development. The reflective collaborative work system is composed of four supportive parts: work flow management, personal workspace, collaborative workspace, and collaborative reflection.

  • PDF

Multi-Dimentional Scaling Analysis for Interior Space Planning Correponding to Korean Housing Behavior (한국인의 주거의식 행태에 순응하는 실내공간 계획을 위한 다차원 구조적 접근)

  • 이연숙;장순원;안지영
    • Korean Institute of Interior Design Journal
    • /
    • no.1
    • /
    • pp.52-55
    • /
    • 1992
  • The purpose of this study was to suggest the spatial structure among residential behaviors in relation to work space. To find the structure, Multi-Dimensional Scaling analysis was used. Respondents were 349 middle income housewives living in apartments in the area of Caopital region. Data were collected through the questinnaire survey. For the future residential interior design, following points were sugtested. A laundary space neess to be developed independently , being separated from both bathroom and kitchen/dining space. A new area which will give housewives some territoriality and also function as home office needs to be considered. A space configuration which satisfies the organic relationships among laundary behaviors such as washing dying, ironing and folding , needs to be systematically planned, with two adjoining separate zones of wet and dry utility . The present bathroom nees to be more incorporated to the private bedroom rather than to workspace.

  • PDF

Real-time collision-free path planning for robot manipulator

  • Hamada, Koichi;Hori, Yoichi
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 1994.10a
    • /
    • pp.328-333
    • /
    • 1994
  • This paper presents a real-time calculation method to generate the trajectory of robot manipulator for the purpose of avoiding collision. In order to model 3-D workspace, we use octree which has been used for fast collision detection. The levels of octree are used as the cost function to represent the distance between the manipulator and the obstacles. This criterion is not exact, but, due to this, we can obtain the approximate feasible trajectory extremely quickly. We will show the effectiveness of our method with some simulation examples. For example, the proposed method can solve a problem within 1 second on Intel 80486 processor running at 33 MHz. It has taken more than half an hour with one of the previously proposed methods.

  • PDF

COORDINATION CHART COLLISION-FREE MOTION OF TWO ROBOT ARMSA

  • Shin, You-Shik;Bien, Zeung-Nam
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 1987.10a
    • /
    • pp.915-920
    • /
    • 1987
  • When a task requires two robot arms to move in a cooperative manner sharing a common workspace, potential collision exists between the two robot arm . In this paper, a novel approach for collision-free trajectory planning along paths of two SCARA-type robot arms is presented. Specifically, in order to describe potential collision between the links of two moving robot arms along the designated paths, an explicit form of "Virtual Obstacle" is adopted, according to which links of one robot arm are made to grow while the other robot arm is forced to shrink as a point on the path. Then, a notion of "Coordination Chart" is introduced to visualize the collision-free relationship of two trajectories.of two trajectories.

  • PDF