• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.12 no.6
• /
• pp.2760-2769
• /
• 2011

An intelligent autonomous robot generates a plan to achieve a goal. A plan is a sequence of robot actions that accomplish a given mission by being successfully executed. However, in the complex and dynamic real world, a robot may encounter unexpected situations and may not execute its planned actions any more. Therefore, an intelligent autonomous robot must prepare an efficient handling process to cope with these situations to successfully complete a given mission. Plan repair with milestone states is an efficient method to cope with the situation. It retains the advantages of other plan repair procedures. This paper proposes a regressive method of formulating milestone states and a method of assigning weighting values on conditions that compose a milestone state. The task to repair a plan may employ the weighting values as its job priority. The regressive method formulates less complex milestone states and leads to the conditions of a milestone state to take pertinent weighting values for an efficient handling procedure to repair a plan with milestone states.

• Proceedings of the Korean Society of Precision Engineering Conference
• /
• 2012.05a
• /
• pp.635-636
• /
• 2012

• Proceedings of the Korean Society of Precision Engineering Conference
• /
• 2009.06a
• /
• pp.1063-1064
• /
• 2009

• Proceedings of the Korean Society of Precision Engineering Conference
• /
• 2008.06a
• /
• pp.919-920
• /
• 2008

• Journal of Institute of Control, Robotics and Systems
• /
• v.17 no.9
• /
• pp.902-907
• /
• 2011

In this paper, we deal with performance evaluation of visual path following using 2D and 3D information. Visual path follow first teaches driving path by selecting milestone images then follows the same route by comparing the milestone image and current image. We follow the visual path following algorithm of [8] and [10]. In [8], a robot navigated with 2D image information only. But in [10], local 3D geometries are reconstructed between the milestone images in order to achieve fast feature prediction which allows the recovery from tracking failures. Experimental results including diverse indoor cases show performance of each algorithm.

• Korean Architects
• /
• s.637
• /
• pp.58-63
• /
• 2022

• The KIPS Transactions:PartD
• /
• v.16D no.1
• /
• pp.105-112
• /
• 2009

Risk management is increasingly seen as one of the main jobs of project managers. It involves anticipating risks that might affect the project schedule or the quality of the software being developed and taking action to avoid these risks. The results of the risk analysis should be documented in the project plan along with an analysis of the consequences of a risk occurring. Effective risk management makes it easier to cope with problems and to ensure that these do not lead to unacceptable budget or schedule slippage. This research provides criteria of analysis of risk items to the estimation of process milestone on software development. Also, In this paper propose to a fixed quantity and transition phase.

• 한국생물공학회:학술대회논문집
• /
• 2003.04a
• /
• pp.20-21
• /
• 2003

• Journal of Acupuncture Research
• /
• v.25 no.3
• /
• pp.205-213
• /
• 2008

The purpose of this case is to report the improvement after treatment on the patient who has development disabilities with Goldenhar's syndrome. We treated the patient with acupuncture treatment from 10th November 2006 to 22nd May 2008. We checked the patient with Goldberg's Developmental Milestone. After treatment developmental levels of cognition, motion, language and sociability were improved. This case shows oriental medical treatment has useful effect on development disabilities.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.38 no.2
• /
• pp.25-42
• /
• 2013

We consider a project time-cost tradeoff problem with two milestones, where one of the jobs has an uncertain processing time. Unless each milestone is completed on time, some penalty cost may be imposed. However, the penalty costs can be avoided by compressing the processing times of some jobs, which requires additional resources or costs. The objective is to minimize the expected total costs subject to the constraint on the expected project completion time. We show that the problem can be solved in polynomial time if the precedence graph of a project is a chain.