• Title/Summary/Keyword: Time-To-Collision

Search Result 1,088, Processing Time 0.029 seconds

Methodology for Evaluating Collision Risks Using Vehicle Trajectory Data (개별차량 주행패턴 분석을 통한 교통사고 위험도 분석 기법)

  • Kim, Joon-Hyung;Song, Tai-Jin;Oh, Cheol;Sung, Nak-Moon
    • Journal of Korean Society of Transportation
    • /
    • v.26 no.5
    • /
    • pp.51-62
    • /
    • 2008
  • An innovative feature of this study is to propose a methodology for evaluating safety performance in real time based on vehicle trajectory data extracted from video images. The essence of evaluating safety performance is to capture unsafe car-following and lane-changing events generated by individual vehicles traveling within video surveillance area. The proposed methodology derived three indices including real-time safety index(RSI) based on the concept of safe stopping distance, time-to-collision(TTC), and the collision energy based on the conservation of momentum. It is believed that outcomes would be greatly utilized in developing a new generation of video images processing(VIP) based traffic detection systems capable of producing safety performance measurements. Relevant technical challenges for such detection systems are also discussed.

Path Collision-aware Real-time Link Scheduling for TSCH Wireless Networks

  • Darbandi, Armaghan;Kim, Myung Kyun
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.13 no.9
    • /
    • pp.4429-4445
    • /
    • 2019
  • As low-power and low-rate WSNs are being widely used for industrial applications, the scheduling of such applications becomes a critical issue to guarantee meeting the stringent requirements of determinism and tight latencies. This paper studies the link scheduling problem for real-time industrial applications in time-slotted channel hopping (TSCH) networks. We propose a heuristic algorithm for centralized link scheduling referred to as path-collision aware least laxity first (PC-LLF) algorithm, which dynamically prioritizes the packets based on the laxity time to the end-to-end deadlines and the amount of collisions that messages might deal with along their designated paths to the destination device. We propose schedulability analysis of real-time applications scheduled under our prioritization approach over TSCH networks, based on the literature on real-time schedulability analysis of multiprocessors and distributed systems. We show that our methodology provides an improved schedulability condition with respect to the existing approaches. Performance evaluation studies quantify to quantify the performance of our proposed approach under a variety of scenarios.

Real-time collision detection for dynamic objects (동적 객체간의 실시간 충돌 감지 알고리즘)

  • Oh, Sang-Young;Hwang, Seon-Min
    • Journal of the Korea Academia-Industrial cooperation Society
    • /
    • v.9 no.3
    • /
    • pp.717-720
    • /
    • 2008
  • This paper studies a collision detection technique to dealing with moving polyhedra. Even though the problem is well-studied in computer graphics, the existing methods are inapplicable to highly dynamic environments. We use the GJK algorithm to determine collisions between convex objects. Also, our method is applied for moving objects.

Path Control Algorithm for AGV Using Right of Path Occupation (경로 점유권을 이용한 AGV의 경로 제어 알고리즘)

  • Joo, Young-Hoon;Kim, Jong-Seon
    • Journal of the Korean Institute of Intelligent Systems
    • /
    • v.18 no.5
    • /
    • pp.592-598
    • /
    • 2008
  • This paper presents collision prediction and avoidance method for AGVS (Automatic Guide Vehicle System). Also, we propose the PO(Right of Path Occupying) with decentralized delay time for collision avoidance. Classified essential element of AGV's working environment is modeled in this paper. Using this model, we propose a new shortest path algorithm using A* search algorithm and obtain the information on AGVs travel time, coordinates and rotation vector. Finally, we use the AGVs information data as input for simulation program. The simulation practice is used in order to evaluate a collision prediction and avoidance, and it has been presented to demonstrate the applicability of the minimize delay time.

Multi-Channel Time Division Scheduling for Beacon Frame Collision Avoidance in Cluster-tree Wireless Sensor Networks (클러스트-트리 무선센서네트워크에서 비콘 프레임 충돌 회피를 위한 멀티채널 시분할 스케줄링)

  • Kim, Dongwon
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.17 no.3
    • /
    • pp.107-114
    • /
    • 2017
  • In beacon-enabled mode, beacon collision is a significant problem for the scalability of cluster-tree wireless sensor networks. In this paper, multi-channel time division scheduling (MCTS) is proposed to prevent beacon collisions and provide scalability. A coordinator broadcasts a beacon frame, including information on allocated channels and time-slots, and a new node determines its own channel and time-slot. The performance of the proposed method is evaluated by comparing the proposed approach with a typical ZigBee. MCTS prevents beacon collisions in cluster-tree wireless sensor networks. It enables large-scale wireless sensor networks based on a cluster tree to be scalable and effectively constructed.

OPTIMAL FORMATION TRAJECTORY-PLANNING USING PARAMETER OPTIMIZATION TECHNIQUE

  • Lim, Hyung-Chul;Bang, Hyo-Choong;Park, Kwan-Dong;Lee, Woo-Kyoung
    • Journal of Astronomy and Space Sciences
    • /
    • v.21 no.3
    • /
    • pp.209-220
    • /
    • 2004
  • Some methods have been presented to get optimal formation trajectories in the step of configuration or reconfiguration, which subject to constraints of collision avoidance and final configuration. In this study, a method for optimal formation trajectory-planning is introduced in view of fuel/time minimization using parameter optimization technique which has not been applied to optimal trajectory-planning for satellite formation flying. New constraints of nonlinear equality are derived for final configuration and constraints of nonlinear inequality are used for collision avoidance. The final configuration constraints are that three or more satellites should be placed in an equilateral polygon of the circular horizontal plane orbit. Several examples are given to get optimal trajectories based on the parameter optimization problem which subjects to constraints of collision avoidance and final configuration. They show that the introduced method for trajectory-planning is well suited to trajectory design problems of formation flying missions.

A study of the development of Ship's Collision Risk Algorithm by Relative bearing in Closest Position of Approach(CPA) (최근접점 상대방위에 따른 선박충돌위험알고리즘 개발에 관한 연구)

  • Lee, Jin-Suk;Song, Chae-Uk;Jung, Min
    • Proceedings of the Korean Institute of Navigation and Port Research Conference
    • /
    • 2015.10a
    • /
    • pp.47-48
    • /
    • 2015
  • VTSO make a decision which one will be danger and what to expect ship's actions due to each encountering situation with CPA(Closest Point of Approach) and TCPA(Time to Closest Point of Approach) by monitoring ship's vectors(Course & Speeds) in real-time through the VTS system. This study is the fundamental research for developing algorithm and system that does not decide the collision risk in one's own ship's viewpoints, but it identifies the related ships into danger through the third party(VTS ) in real time.

  • PDF

Gen2-Based Tag Anti-collision Algorithms Using Chebyshev's Inequality and Adjustable Frame Size

  • Fan, Xiao;Song, In-Chan;Chang, Kyung-Hi;Shin, Dong-Beom;Lee, Heyung-Sub;Pyo, Cheol-Sig;Chae, Jong-Suk
    • ETRI Journal
    • /
    • v.30 no.5
    • /
    • pp.653-662
    • /
    • 2008
  • Arbitration of tag collision is a significant issue for fast tag identification in RFID systems. A good tag anti-collision algorithm can reduce collisions and increase the efficiency of tag identification. EPCglobal Generation-2 (Gen2) for passive RFID systems uses probabilistic slotted ALOHA with a Q algorithm, which is a kind of dynamic framed slotted ALOHA (DFSA), as the tag anti-collision algorithm. In this paper, we analyze the performance of the Q algorithm used in Gen2, and analyze the methods for estimating the number of slots and tags for DFSA. To increase the efficiency of tag identification, we propose new tag anti-collision algorithms, namely, Chebyshev's inequality, fixed adjustable framed Q, adaptive adjustable framed Q, and hybrid Q. The simulation results show that all the proposed algorithms outperform the conventional Q algorithm used in Gen2. Of all the proposed algorithms, AAFQ provides the best performance in terms of identification time and collision ratio and maximizes throughput and system efficiency. However, there is a tradeoff of complexity and performance between the CHI and AAFQ algorithms.

  • PDF

Development of an Autonomous Mobile Robot with Functions of Speech Recognition and Collision Avoidance

  • Park, Min-Gyu;Lee, Min-Cheol
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 2000.10a
    • /
    • pp.475-475
    • /
    • 2000
  • This paper describes the construction of an autonomous mobile robot with functions of collision avoidance and speech recognition that is used for teaching path of the robot. The human voice as a teaching method provides more convenient user-interface to mobile robot. For safe navigation, the autonomous mobile robot needs abilities to recognize surrounding environment and avoid collision. We use u1trasonic sensors to obtain the distance from the mobile robot to the various obstacles. By navigation algorithm, the robot forecasts the possibility of collision with obstacles and modifies a path if it detects dangerous obstacles. For these functions, the robot system is composed of four separated control modules, which are a speech recognition module, a servo motor control module, an ultrasonic sensor module, and a main control module. These modules are integrated by CAN(controller area network) in order to provide real-time communication.

  • PDF

Obstacle-avoidance Algorithm using Reference Joint-Velocity for Redundant Robot Manipulator with Fruit-Harvesting Applications

  • Y.S. Ryuh;Ryu, K.H.
    • Proceedings of the Korean Society for Agricultural Machinery Conference
    • /
    • 1996.06c
    • /
    • pp.638-647
    • /
    • 1996
  • Robot manipulators for harvesting fruits must be controlled to track the desired path of end-effector to avoid obstacles under the consideration of collision free area and safety path. This paper presents a robot path control algorithm to secure a collision free area with the recognition of work environments. The flexible space, which does not damage fruits or branches of tree due to their flexibility and physical properties , extends the workspace. Now the task is to control robot path in the extended workspace with the consideration of collision avoidance and velocity limitation at the time of collision concurrently. The feasibility and effectiveness of the new algorithm for redundant manipulators were tested through simulations of a redundant manipulator for different joint velocities.

  • PDF