• 제어로봇시스템학회:학술대회논문집
• /
• 1992.10a
• /
• pp.387-392
• /
• 1992

This paper presents a local trajectory generation method which is based on a sequence of reference posture-velocities and the efficient low level control algorithm which constructs the complete smooth curve from the trajectory specification. The reference trajectory generator(RTG) which is in between the local path planner(LPP) and the robot motion controller(RMC) generates a sequence of set-points for each path segments from the LPP and pass it to the RMC. The RMC controls the motions of vehicle which should follow the sequence. In the feedback controller of VMC, the method which compensates robot posture-velocity error correctly is used. These methods are implemented on indoor autonomous vehicle, 'ALIVE' mobile robot. The ALIVE mobile robot system is implemented on the 32bit VME bus system: the two VME CPU's are used for RTG and RMC, while the 80C196KC-based VME board is used for motor controller.

• Proceedings of the IEEK Conference
• /
• 2003.11b
• /
• pp.171-174
• /
• 2003

Shortest path problems are among the most studied network flow optimization problems, with interesting applications in various fields. One such field is the route determination service, where various kinds of shortest path problems need to be solved in location-based service. Our research aim is to propose a route technique in real-time location-based service (LBS) environments according to user's route preferences such as shortest, fastest, easiest and so on. Turn costs modeling and computation are important procedures in route planning. We propose a new rest modeling method for turn costs which are traditionally attached to edges in a graph. Our proposed route determination technique also has an advantage that can provide service interoperability by implementing XML web service for the OpenLS route determination service specification.

• 정보저장시스템학회:학술대회논문집
• /
• 2005.10a
• /
• pp.246-247
• /
• 2005

This study suggested fanless thermal design using CAE technique for the information storage system under the serious thermal problem. At first, main heat flow was controlled by CAE based fanless heat sink design not to influence sensitive optical pick-up sensor. Then, vent parametric studies found a thermal solution about highly concentrated case top heat due to fanless. These CAE results were verified by experimental methods. As a consequence of newly designed thermal path, thermal specification of optical pick-up sensor was satisfied and fanless thermal design for the information storage system was achieved.

• 제어로봇시스템학회:학술대회논문집
• /
• 1997.10a
• /
• pp.617-620
• /
• 1997

We have built a robot soccer system to participate in MIROSOT97. This paper represents hardware specification of our system and our strategy. We select a centralized on-line system for a soccer game. The paper explains hardware specifications of our system for later development. Also, the paper explains our strategy from two viewpoints. From the viewpoint of cooperation, some heuristic ideas are implemented. From the viewpoint of path plan, Cubic spline is used with cost function which minimized time, radius of curvature for smoothness, and obstacle potential field. Direct comparison will be realized in MIROSOT97.

• Journal of the Institute of Electronics Engineers of Korea TE
• /
• v.39 no.4
• /
• pp.329-334
• /
• 2002

For the testability, this paper proposed the algorithm at autonomous synthesis which includes the data path structure as the self testing as possible on high level synthesis method when VHDL, coding is used in the system design area. In the proposed algorithm of this paper, MUXs and registers are assigned to the data path of designed system. And the designed data path could be mapped the H/W specification of described VHDL coding to the testable library. As a results, it was mapped H/W to the assign algorithm that is minimized MUX and the registers in collision graph.

• Journal of Internet Computing and Services
• /
• v.9 no.2
• /
• pp.89-105
• /
• 2008

So far, most of research on automated test data generation(ATDG) deals with programs without pointers. Recently, few works hove been done on ATDG in the presence of pointers, but they ore path-oriented techniques which require the specification of on entire program path to be tested or a program to be executed. This paper presents a new technique for generating test data even without specifying a program path completely. The presented technique is a static technique which transforms the test data generation problem into a SAT(SATisfiability) problem and makes advantage of SAT solvers for ATDG. For the ends, we transform a program under test into Alloy which is the first-order relational logic and then produce test data via Alloy analyzer.

• Journal of the Korea Society for Simulation
• /
• v.19 no.3
• /
• pp.27-35
• /
• 2010

War-games using C4I systems have been used to improve the command ability of commanders and the fighting power of combat forces. During a war-game simulation, a commander makes a plan for the movement of a combat force and issues orders to the combat force according to the plan. If it is possible to minimize damages from the artillery of enemy forces and take the advantage position where is effective for attack/defense, we can hold a dominant position of the battlefield. Therefore, this papers proposes a genetic algorithm-based optimal path searching method. The proposed method creates an optimal path of a combat force by taking into consideration dangerous conditions of the battlefield in which the combat force is. This paper also shows the process of creating an optimal path by using a discrete event specification modeling and simulation method.

• Proceedings of the KSRS Conference
• /
• 2003.11a
• /
• pp.843-845
• /
• 2003

Shortest Path Problems are among the most studied network flow optimization problems, with interesting applications in various fields. One such field is the route determination service, where various kinds of shortest path problems need to be solved in location-based service. Our research aim is to propose a route technique in real-time locationbased service (LBS) environments according to user’s route preferences such as shortest, fastest, easiest and so on. Turn costs modeling and computation are important procedures in route planning. There are major two kinds of cost parameters in route planning. One is static cost parameter which can be pre-computed such as distance and number of traffic-lane. The other is dynamic cost parameter which can be computed in run-time such as number of turns and risk of congestion. In this paper, we propose a new cost modeling method for turn costs which are traditionally attached to edges in a graph. Our proposed route determination technique also has an advantage that can provide service interoperability by implementing XML web service for the OpenLS route determination service specification. In addition to, describing the details of our shortest path algorithms, we present a location-based service system by using proposed routing algorithms.

• Journal of the Korea Society of Computer and Information
• /
• v.12 no.3
• /
• pp.251-258
• /
• 2007

With the increase of a web service technology, a new access control mechanism has developed for XML documents. As a result, as legacy access control systems, access control systems has become an active research topic. In this paper, we propose a methodology to translate access control policies for XML documents into formal specification language CSP. To do this, first, we introduce a method to translate a hierarchical access to XML documents using XPath language into CSP process algebra. Second, we explain a method to represent a XML schema as a formal model like automata. Third, we present a method for representing the semantics of access control policies such as the scope of rules and confliction resolution into a process algebra language. Finally, a CSP specification example of an XML schema and path expressions aye shown to illustrate the validity of our approach.

• Journal of the Korea Society for Simulation
• /
• v.17 no.4
• /
• pp.153-158
• /
• 2008

The technology of Software Defined Radio (SDR) is a possible solution to interwork flexibly between various wireless transport protocols. Ubiquitous network, like u-health service network, includes sensor devices or nodes which do not facilitate all the same transport protocols to access network. As such this may be in such unreachable situations as poverty of all required AP (Access Point)’s, faults or contention in a path of particular protocol communication, etc. This paper presents research results of modeling and simulation to analyze transport performance of multi-protocol ubiquitous network which includes SDR-based interwork nodes and congestion-controlled AP’s. Focusing mainly on dynamics of overall transport performance rather than protocol execution procedures, this paper employs the Zeigler’s DEVS (Discrete Event Systems Specification) methodology and DEVSim++simulation environment to experiment.