• 제어로봇시스템학회:학술대회논문집
• /
• 2000.10a
• /
• pp.254-254
• /
• 2000

This paper presents a genetic programming based evolutionary strategy for on-line adaptive learnable evolvable hardware. genetic programming can be useful control method for evolvable hardware for its unique tree structured chromosome. However it is difficult to represent tree structured chromosome on hardware, and it is difficult to use crossover operator on hardware. Therefore, genetic programming is not so popular as genetic algorithms in evolvable hardware community in spite of its possible strength. We propose a chromosome representation methods and a hardware implementation method that can be helpful to this situation. Our method uses context switchable identical block structure to implement genetic tree on evolvable hardware. We composed an evolutionary strategy (or evolvable hardware by combining proposed method with other's striking research results. Proposed method is applied to the autonomous mobile robots cooperation problem to verify its usefulness.

• 제어로봇시스템학회:학술대회논문집
• /
• 2001.10a
• /
• pp.36.6-36
• /
• 2001

The problem of robot navigation and control is a complex task. Its complexity and characteristics depends on the characteristics of the environment robot inhabits, robot construction (mechanical abilities to move, sense) and the job the robot is supposed to do. In this paper we propose a hybrid programming approach to mobile robot navigation and control in an indoor environment. In our approach we used declarative, procedural, and object oriented programming paradigms and we utilized some advantages of our distributed computing architecture. The programming languages corresponding to the paradigms we used were C, C++ and Prolog. In the paper we present some details of our mobile robot hardware and software structure, focusing on the software design and implementation.

• Journal of applied mathematics & informatics
• /
• v.37 no.1_2
• /
• pp.157-162
• /
• 2019

Programming tools are essential for students learning numerical analysis. It is troublesome to go to a laboratory where a computer is located after taking a lecture. Nowadays most students have mobile phones which can be used for programming practice through the Internet. PHP is a server-side scripting language designed for web development but also used as a general-purpose programming language. However, PHP has many inconveniences, such as adding a dollar symbol ($) to every varable. This paper introduces a slightly modified language, NAPHP, and a system which is designed for students to use their own mobile phone to write down the language NAPHP and run it on the web page. The system NAPHP-SYS is an educational tool that turns NAPHP into PHP, run PHP code and show the results on the web.

• 한국정보컨버전스학회:학술대회논문집
• /
• 2008.06a
• /
• pp.59-62
• /
• 2008

When performing a project, the most important thing is building a result with planned quality within development period. Particularly, if the project is delayed or has no good quality in the case of the mobile game development project which is sensitive to the release time and quality, it is immediately connected to the failure of the project. Extreme Programming is a methodology that divides the development cycle into smaller units for reducing the risk factor of the project in which the development period is important. In this paper, we suggest the Expanded Extreme Programming for mobile game development environment in which the development period and quality are important

• International Journal of Control, Automation, and Systems
• /
• v.4 no.3
• /
• pp.318-324
• /
• 2006

The mobile manipulator is expected to work in partially defined or unstructured environments. In our global/local approach to path planning, joint trajectories are generated for a desired Cartesian space path, designed by the global path planner. For a local path planner, inverse kinematics for a redundant system is used. Joint displacement limit for the manipulator links is considered in the motion planner. In an event of failure to obtain feasible trajectories, the task cannot be accomplished. At the point of failure, a deviation in the Cartesian space path is obtained and a replanner gives a new path that would achieve the goal position. To calculate the deviation, a nonlinear optimization problem is formulated and solved by standard Sequential Quadratic Programming (SQP) method.

• Journal of Institute of Control, Robotics and Systems
• /
• v.16 no.1
• /
• pp.53-60
• /
• 2010

We propose a motion planning method for autonomous mobile robots. In order to minimize traveling time, a smooth path and a time optimal velocity profile should be generated under kinematic and dynamic constraints. In this paper, we develop an effective and practical method to generate a good solution with lower computation time. The initial path is obtained from voronoi diagram by Dijkstra's algorithm. Then the path is improved by changing the graph and path simultaneously. We apply the dynamic programming algorithm into the stage of improvement. Simulation results are presented to verify the performance of the proposed method.

• Journal of Institute of Control, Robotics and Systems
• /
• v.11 no.4
• /
• pp.322-329
• /
• 2005

This paper considers the application of mobile robot to the herding problem. The herding problem involves a ‘pursuer’ trying to herd a moving ‘evader’ to a predefined location. In this paper, two mobile robots act as pursuer and evader in the fenced area, where the pursuer robot uses a fuzzy cooperative decision strategy (FCDS) in the herding algorithm. To herd evader robot to a predefined position, the pursuer robot calculates strategic herding point and then navigates to that point using FCDS. FCDS consists of a two-level hierarchy: low level motion descriptors and a high level coordinator. In order to optimize the FCDS, we use the multi­thread evolutionary programming algorithm. The proposed algorithm is implemented in the real mobile robot system and its performance is demonstrated using experimental results.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.5 no.4
• /
• pp.292-297
• /
• 2004

This paper is demonstrated about VM that means a circumstance where a application is no dependence of hardware and GVM which is selected by SKT as flatform, thus we developted portris-mobile game based on GVM. this game was embodied(actualized or given to actualized form) by Mobile C and process procedure of Event Drivnen type game that is a characteristic of Mobile C is showed by flowchart.

• Journal of The Korean Association of Information Education
• /
• v.16 no.2
• /
• pp.265-273
• /
• 2012

Current computer education is moving its focus from using oriented education to improving students' creativity and problem solving ability by computer science education. Robot programming education is becoming a major research issue of computer education in the context of creativity education. One of the mainstream ideas of prior research about robot programming is the effect of robot programming. Another is curriculum development of robot programming. But, the focus of current research is moving toward teaching methods of robot programming. The theme of this research is to use examples in robot programming. Example programs are considered the most useful type of material both by the students and the teachers. Example programs play a important role in learning to program. They work as templates, guidelines, and hints for learners when developing their own programs. In this study, I developed a example-based robot programming support system. Due to the trends of smart learning, I developed this system as a mobile web application.

• Journal of Institute of Control, Robotics and Systems
• /
• v.14 no.4
• /
• pp.392-398
• /
• 2008

We propose a new path planning method for autonomous mobile robots. To maximize the utility of mobile robots, the collision-free shortest path should be generated by on-line computation. In this paper, we develop an effective and practical method to generate a good solution by lower computation time. The initial path is obtained from skeleton graph by Dijkstra's algorithm. Then the path is improved by changing the graph and path dynamically. We apply the dynamic programming algorithm into the stage of improvement. Simulation results are presented to verify the performance of the proposed method.