• Journal of Information Processing Systems
• /
• v.15 no.6
• /
• pp.1472-1488
• /
• 2019

Critical elements in the China's Lunar Exploration reside in that the lunar rover travels over the surrounding undetermined environment and it conducts scientific exploration under the ground control via teleoperation system. Such an interplanetary transportation mission teleoperation system belongs to the ground application system in deep space mission, which performs terrain reconstruction, visual positioning, path planning, and rover motion control by receiving telemetry data. It plays a vital role in the whole lunar exploration operation and its so-called trustworthy evidence must be assessed before and during its implementation. Taking ISO standards and China's national military standards as trustworthy evidence source, the net assessment model and net assessment method of teleoperation system are established in this paper. The multi-dimensional net assessment model covering the life cycle of software is defined by extracting the trustworthy evidences from trustworthy evidence source. The qualitative decisions are converted to quantitative weights through the net assessment method (NAM) combined with fuzzy analytic hierarchy process (FAHP) and entropy weight method (EWM) to determine the weight of the evidence elements in the net assessment model. The paper employs the teleoperation system for interplanetary transportation as a case study. The experimental result drawn shows the validity and rationality of net assessment model and method. In the final part of this paper, the untrustworthy elements of the teleoperation system are discovered and an improvement scheme is established upon the "net result". The work completed in this paper has been applied in the development of the teleoperation system of China's Chang'e-3 (CE-3) "Jade Rabbit-1" and Chang'e-4 (CE-4) "Jade Rabbit-2" rover successfully. Besides, it will be implemented in China's Chang'e-5 (CE-5) mission in 2019. What's more, it will be promoted in the Mars exploration mission in 2020. Therefore it is valuable to the development process improvement of aerospace information system.

• IE interfaces
• /
• v.25 no.3
• /
• pp.365-375
• /
• 2012

An Unmanned Aerial Vehicle (UAV) is a powered pilotless aircraft, which is controlled remotely or autonomously. UAVs are an attractive alternative for many scientific and military organizations. UAVs can perform operations that are considered to be risky or uninhabitable for humans. UAVs are currently employed in many military missions and a number of civilian applications. For accomplishing the UAV's missions, guarantee of survivability should be preceded. The main objective of this study is to suggest a mathematical programming model and a $A^*PS$_PGA (A-star with Post Smoothing_Parallel Genetic Algorithm) for Multiple UAVs's path planning to maximize survivability. A mathematical programming model is composed by using MRPP (Most Reliable Path Problem) and MTSP (Multiple Traveling Salesman Problem). After transforming MRPP into Shortest Path Problem (SPP),$A^*PS$_PGA applies a path planning for multiple UAVs.

• Journal of Astronomy and Space Sciences
• /
• v.11 no.2
• /
• pp.296-307
• /
• 1994

Using X-Window system (Motif Graphic User Interface), the AKM (Apogee Kick Motor) firing software for Koreasat which will be launched in 1995 has been developed to transfer the spacecraft from its transfer orbit, provided by the DeltaII launch vehicle, into a nearly geostationary drift orbit. The AKM firing software runs in one of two modes. In mission analysis mode, using a fixed magnitude impulsive velocity change, it provides the necessary data for planning the burn parameters. In insert mode, it uses the orbit propagator function to integrate the spacecraft state through the AKM burn. In this case, an AKM thrust profile and specific impulse are applied to the necessary data for planning the burn parameters to obtain the best possible drift orbit. The apogee burn planning simulation for orbital transfer of Koreasat has been performed using the AKM firing software. And the result of this simulation has been analyzed.

• Journal of the Korean Society for information Management
• /
• v.25 no.3
• /
• pp.249-271
• /
• 2008

This is a preliminary study to suggest the directions of strategic planning for archival information services in the National Archives of Korea(NAK). It has three parts. Firstly, it articulates the concept and the process of strategic planning and analyses the archival service strategies for NARA(US) and TNA(UK). Secondly, regarding our conditions, it suggests strategic goals, action plans and principles for the archival information services of NAK. Thirdly, it evaluates the current archival information services of NAK based on the suggested goals and plans and points out the aspects that is to be more strengthened to achieve these goals.

• The Journal of Korea Robotics Society
• /
• v.18 no.1
• /
• pp.10-17
• /
• 2023

Recently, robots have been actively utilized for logistics and delivery services in various places such as restaurants, hotels, and hospitals. In addition, it provides a safer environment, convenience, and cost efficiency to the customers. However, when it comes to autonomous delivery in a multi-floor environment, the task is still challenging. Especially for wheeled mobile robots, it is necessary to deal with elevators to perform the last-mile delivery services. Therefore, we present a multi-floor route planning algorithm that enables a wheeled mobile robot to traverse an elevator for the delivery service. In addition, an elevator boarding mission algorithm was developed to perceive the drivable region within the elevator and generate a feasible path that is collision-free. The algorithm was tested with real-world experiments and was demonstrated to perform autonomous postal delivery service in a multi-floor building. We concluded that our study could contribute to building a stable autonomous driving robot system for a multi-floor environment.

• The Journal of Korea Robotics Society
• /
• v.18 no.1
• /
• pp.1-9
• /
• 2023

This paper presents an optimal path planning strategy for aerial searching and surveying of a user-designated area using multiple Unmanned Aerial Vehicles (UAVs). The method is designed to deal with a single unseparated polygonal area, regardless of polygonal convexity. By defining the search area into a set of grids, the algorithm enables UAVs to completely search without leaving unsearched space. The presented strategy consists of two main algorithmic steps: cellular decomposition and path planning stages. The cellular decomposition method divides the area to designate a conflict-free subsearch-space to an individual UAV, while accounting the assigned flight velocity, take-off and landing positions. Then, the path planning strategy forms paths based on every point located in end of each grid row. The first waypoint is chosen as the closest point from the vehicle-starting position, and it recursively updates the nearest endpoint set to generate the shortest path. The path planning policy produces four path candidates by alternating the starting point (left or right edge), and the travel direction (vertical or horizontal). The optimal-selection policy is enforced to maximize the search efficiency, which is time dependent; the policy imposes the total path-length and turning number criteria per candidate. The results demonstrate that the proposed cellular decomposition method improves the search-time efficiency. In addition, the candidate selection enhances the algorithmic efficacy toward further mission time-duration reduction. The method shows robustness against both convex and non-convex shaped search area.

• ETRI Journal
• /
• v.30 no.1
• /
• pp.1-12
• /
• 2008

In this paper, we propose an efficient single-resource task scheduling algorithm for the Communication, Ocean, and Meteorological Satellite. Among general satellite planning functions such as constraint check, priority check, and task scheduling, this paper focuses on the task scheduling algorithm, which resolves conflict among tasks which have an exclusion relation and the same priority. The goal of the proposed task scheduling algorithm is to maximize the number of tasks that can be scheduled. The rationale of the algorithm is that a discarded task can be scheduled instead of a previously selected one depending on the expected benefit acquired by doing so. The evaluation results show that the proposed algorithm enhances the number of tasks that can be scheduled considerably.

• Journal of the Korea Institute of Military Science and Technology
• /
• v.15 no.3
• /
• pp.272-287
• /
• 2012

The optimal use of sonar systems for detection is a practical problem in a given ocean environment. In order to quantify the mission achievability in general, measure of effectiveness(MOE) is defined for specific missions. In this paper, using the specific MOE for detection, which is represented as cumulative detection probability(CDP), an integrated software package named as Optimal Acoustic Search Path Planning(OASPP) is developed. For a given ocean environment and sonar systems, the discrete observations for detection probability(PD) are used to calculate CDP incorporating sonar and environmental parameters. Also, counter-detection probability is considered for vulnerability analysis for a given scenario. Through modeling and simulation for a simple case for which an intuitive solution is known, the developed code is verified.

• Electronics and Telecommunications Trends
• /
• v.34 no.3
• /
• pp.43-54
• /
• 2019

Currently, the use of unmanned aerial vehicles (UAVs) is spreading from recreational purposes to the public- and commercial-use product areas. Various efforts are being made worldwide to ensure the safety of UAVs and expand their service applications and convenience, because autonomous flights are becoming increasingly popular. In order for a UAV to perform autonomous flight and mission without operator assistance, environmental perception technology, path planning technology, and flight control technology are needed. In this article, we present recent trends in these technologies.

• Journal of the Korean Society for Aeronautical & Space Sciences
• /
• v.43 no.6
• /
• pp.488-496
• /
• 2015

This paper proposes a framework to determine the routes of multiple unmanned aerial vehicles (UAVs) to conduct multiple tasks in different locations considering the survivability of the vehicles. The routing problem can be formulated as the vehicle routing problem (VRP) with different cost matrices representing the trade-off between the safety of the UAVs and the mission completion time. The threat level for a UAV at a certain location was modeled considering the detection probability and the shoot-down probability. The minimal-cost path connecting two locations considering the threat level and the flight distance was obtained using the Dijkstra algorithm in hexagonal cells. A case study for determining the optimal routes for a persistent multi-UAVs surveillance and reconnaissance missions given multiple enemy bases was conducted and its results were discussed.