• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.32 no.4
• /
• pp.617-628
• /
• 2022

Ascon is one of the final round candidates of the NIST lightweight cryptography contest, which has been underway since 2015, and supports hash modes Ascon-Hash and Ascon-Xof. In this paper, we develop a MILP model for collision attack on the Ascon-Hash and search for a differential trail that can be used in a quantum setting through the model. In addition, we present an algorithm that allows an attacker who can use a quantum computer to find a quantum free-start collision attack of 3-round Ascon-Hash using the discovered differential trail. This attack is meaningful in that it is the first to analyze a collision attack on Ascon-Hash in a quantum setting.

• International Journal of Control, Automation, and Systems
• /
• v.2 no.1
• /
• pp.107-117
• /
• 2004

A new algorithm for planning a collision-free path based on an algebraic curve as well as the concept of path space is developed. Robot path planning has so far been concerned with generating a single collision-free path connecting two specified points in a given robot workspace with appropriate constraints. In this paper, a novel concept of path space (PS) is introduced. A PS is a set of points that represent a connection between two points in Euclidean metric space. A geometry mapping (GM) for the systematic construction of path space is also developed. A GM based on the 2$^{nd}$ order base curve, specifically Bezier curve of order two is investigated for the construction of PS and for collision-free path planning. The Bezier curve of order two consists of three vertices that are the start, S, the goal, G, and the middle vertex. The middle vertex is used to control the shape of the curve, and the origin of the local coordinate (p, $\theta$) is set at the centre of S and G. The extreme locus of the base curve should cover the entire area of actual workspace (AWS). The area defined by the extreme locus of the path is defined as quadratic workspace (QWS). The interference of the path with obstacles creates images in the PS. The clear areas of the PS that are not mapped by obstacle images identify collision-free paths. Hence, the PS approach converts path planning in Euclidean space into a point selection problem in path space. This also makes it possible to impose additional constraints such as determining the shortest path or the safest path in the search of the collision-free path. The QWS GM algorithm is implemented on various computer systems. Simulations are carried out to measure performance of the algorithm and show the execution time in the range of 0.0008 ~ 0.0014 sec.

• Publications of The Korean Astronomical Society
• /
• v.11 no.1
• /
• pp.125-137
• /
• 1996

The collision of two particles in the accretion disk may lead to be a mechanism of heat generation. By using hydrodynamic equations, the mean free path, the collision frequency and the deflection angle due to the collision of the particles are derived as a function of the mass accretion rate. The mean free path seems to be a smaller fraction compared to the dimension parameter of the system. The radiative flux in the disk is obtained under the influence of the collision of the particles.

• Journal of Korean Institute of Industrial Engineers
• /
• v.22 no.4
• /
• pp.579-588
• /
• 1996

The purpose of this paper is to develop a method of Collision-Free Path Planning (CFPP) for an articulated robot. First, the configuration of the robot is built by a set of robot joint angles derived from robot inverse kinematics. The joint space, that is made of the joint angle set, forms a Configuration space (Cspcce). Obstacles in the robot workcell are also transformed into the Cobstacles using slice projection method. Actually the Cobstacles means the configurations of the robot causing collision with obstacles. Secondly, a connected graph, a kind of roadmap, is constructed by the free configurations in the Cspace, where the free configurations are randomly sampled from a free Cspace immune from the collision. Thirdly, robot paths are optimally determinant in the connected graph. A path searching algorithm based on $A^*$ is employed in determining the paths. Finally, the whole procedures for the CFPP method are shown for a proper articulated robot as an illustrative example.

• Journal of the Korean Institute of Telematics and Electronics
• /
• v.26 no.10
• /
• pp.1480-1487
• /
• 1989

An approach for collision-free coordination plan along designated paths of two robots in a common workspace is presented. Specifically, a notion of coordination space is introduced to visualize all the collision-free coordinations for the two robots. Then a problem is formulated and resolved in order to find the optimal coordination curve which trade off between safety of two robots and difference of degree of accomplishment.

• 제어로봇시스템학회:학술대회논문집
• /
• 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.

• Journal of Institute of Control, Robotics and Systems
• /
• v.3 no.5
• /
• pp.461-468
• /
• 1997

A real-time collision-free trajectory control method for dual arm robot system is proposed. The proposed method is composed of two stages; one is to calculate the minimum distance between two robot arms and the other is to control the trajectories of the robots to ensure collision-free motions. The calculation of minimum distance between two robots is, also, composed of two steps. To reduce the calculation time, we, first, apply a simple modeling technique to the robots arms and determine the interested part of the robot arms. Next, we apply more precise modeling techniques for the part to calculate the minimum distance. Simulation results show that the whole algorithm runs within 0.05 second using Pentium 100MHz PC.

• Proceedings of the Korean Society for Noise and Vibration Engineering Conference
• /
• 2001.05a
• /
• pp.979-983
• /
• 2001

We develop a new method of simultaneous optimization of trajectory and shape of redundant flexible manipulators for collision-free utilizing the B-spline function and a mathematical programming method We adopt an approximate flexible manipulator model which consists of rigid bar elements and spring elements. We use B-spline function for determining the approximate trajectory and the expressions of the outline of obstacles. The used total performance index consists of 2 performance indices. The first is the driving energy, and the second is the trajectory deviation which is caused by the approximate modeling for the flexible manipulator. We design optimal collision-free trajectory of flexible manipulators by searching optimum positions of the control points for B-spline approximation which minimize the performance index subject to constraint condition for collision-free. Some examinations through numerical examples show the effectiveness of the method

• ETRI Journal
• /
• v.43 no.4
• /
• pp.580-593
• /
• 2021

When operating in confined spaces or near obstacles, collision-free path planning is an essential requirement for autonomous exploration in unknown environments. This study presents an autonomous exploration technique using a carefully designed collision-free local planner. Using LiDAR range measurements, a local end-point selection method is designed, and the path is generated from the current position to the selected end-point. The generated path showed the consistent collision-free path in real-time by adopting the Euclidean signed distance field-based grid-search method. The results consistently demonstrated the safety and reliability of the proposed path-planning method. Real-world experiments are conducted in three different mines, demonstrating successful autonomous exploration flights in environment with various structural conditions. The results showed the high capability of the proposed flight autonomy framework for lightweight aerial robot systems. In addition, our drone performed an autonomous mission in the tunnel circuit competition (Phase 1) of the DARPA Subterranean Challenge.

• 제어로봇시스템학회:학술대회논문집
• /
• 1989.10a
• /
• pp.627-634
• /
• 1989

A collision-free trajectory planning algorithm using the iterative learning concept is proposed for dual robot arms in a 3-D workspace to accurately follow their specified paths with constant velocities. Specifically, a collision-free trajectory minimizing the trajectory error is obtained first by employing the linear programming technique. Then the total operating time is iteratively adjusted based on the maximum trajectory error of the previous iteration so that the collision-free trajectory has no deviation from the specified path and also the operating time is near-minimal.