The Design Research of Millimeter-Wave Homing Empty - Empty Ammunition Ballistics

2014 ◽  
Vol 575 ◽  
pp. 337-342
Author(s):  
Wei Shi Xie ◽  
Zhi Hua Xiao ◽  
Jian Tang
Keyword(s):  
Target Tracking ◽  
Millimeter Wave ◽  
Design Research ◽  
Optical Axis ◽  
Terminal Velocity ◽  
Target Model ◽  
Search Area ◽  
Pitch Direction ◽  
Trajectory Guidance ◽  
Terminal Guidance

The millimeter-wave terminal guidance ammunition monitoring scanning field is small. The modified design is in order to improve the search section trajectory guidance. This study established seeker search area to capture the target model, which leads to the missile engine unpowered glide distance formula after flameout. At the millimeter-wave terminal on the missiles contraction section ballistic. Each missile is designed for the flat road, the swash decline ballistic programs. Flat missile road program scans and does not shrink. Its flight speed falls and declines rapidly, has different gliding distance and terminal velocity. After the missile engine is flameout, its start-gliding speed is great. Ramp fell ballistic program enhances the air-air (or air-ground) guided missile’s gliding ability, helping to improve range. But shortcomings are that target tracking scanning domain contracts. Using the seeker optical axis in the pitch direction can achieve accurate positioning with the height precession. Two ballistic designs can both meet the target seeker’s scanning, thus effectively improve the striking precision.

scholarly journals Research on Target Tracking Algorithm Using Millimeter-Wave Radar on Curved Road

2020 ◽  
Vol 2020 ◽  
pp. 1-21
Author(s):  
Shiping Song ◽  
Jian Wu ◽  
Sumin Zhang ◽  
Yunhang Liu ◽  
Shun Yang
Keyword(s):  
Target Tracking ◽  
Millimeter Wave ◽  
Data Association ◽  
Measurement Data ◽  
Tracking Algorithm ◽  
Computational Time ◽  
Millimeter Wave Radar ◽  
Wave Radar ◽  
Curved Road ◽  
Lane Position

Millimeter-wave radar has been widely used in intelligent vehicle target detection. However, there are three difficulties in radar-based target tracking in curves. First, there are massive data association calculations with poor accuracy. Second, the lane position relationship of target-vehicle cannot be identified accurately. Third, the target tracking algorithm has poor robustness and accuracy. A target tracking algorithm framework on curved road is proposed herein. The following four algorithms are applied to reduce data association calculations and improve accuracy. (1) The data rationality judgment method is employed to eliminate target measurement data outside the radar detection range. (2) Effective target life cycle rules are used to eliminate false targets and clutter. (3) Manhattan distance clustering algorithm is used to cluster multiple data into one. (4) The correspondence between the measurement data received by the radar and the target source is identified by the nearest neighbor (NN) data association. The following three algorithms aim to derive the position relationship between the ego-vehicle and the target-vehicles. (1) The lateral speed is obtained by estimating the state of motion of the ego-vehicle. (2) An algorithm for state compensation of target motion is presented by considering the yaw motion of the ego-vehicle. (3) A target lane relationship recognition model is built. The improved adaptive extended Kalman filter (IAEKF) is used to improve the target tracking robustness and accuracy. Finally, the vehicle test verifies that the algorithms proposed herein can accurately identify the lane position relationship. Experiments show that the framework has higher target tracking accuracy and lower computational time.

Detecting, localizing, and tracking an unknown number of moving targets using a team of mobile robots

2017 ◽  
Vol 36 (13-14) ◽  
pp. 1540-1553 ◽  
Author(s):  
Philip Dames ◽  
Pratap Tokekar ◽  
Vijay Kumar
Keyword(s):  
Target Tracking ◽  
Greedy Algorithm ◽  
Fundamental Problem ◽  
Mathematical Concept ◽  
Data Driven ◽  
Objective Functions ◽  
Probability Hypothesis Density ◽  
Target Model ◽  
Density Filter ◽  
New Formulation

Target tracking is a fundamental problem in robotics research and has been the subject of detailed studies over the years. In this paper, we generate a data-driven target model from a real-world dataset of taxi motions. This model includes target motion, appearance, and disappearance from the search area. Using this target model, we introduce a new formulation of the mobile target tracking problem based on the mathematical concept of random finite sets. This formulation allows for tracking an unknown and dynamic number of mobile targets with a team of robots. We show how to employ the probability hypothesis density filter to simultaneously estimate the number of targets and their positions. Next, we present a greedy algorithm for assigning trajectories to the robots to allow them to actively track the targets. We prove that the greedy algorithm is a two-approximation for maximizing submodular tracking objective functions. We examine two such functions: the mutual information between the estimated target positions and future measurements from the robots and a new objective that maximizes the expected number of targets detected by the robot team. We provide extensive simulation evaluations to validate the performance of our data-driven motion model and to compare the behavior and tracking performance of robots using our objective functions.

scholarly journals Resolvable Group State Estimation with Maneuver Based on Labeled RFS and Graph Theory

Sensors ◽  
2019 ◽  
Vol 19 (6) ◽  
pp. 1307
Author(s):  
Weifeng Liu ◽  
Yudong Chi
Keyword(s):  
Graph Theory ◽  
State Estimation ◽  
Target Tracking ◽  
Finite Sets ◽  
Target Model ◽  
Group Members ◽  
Group Target ◽  
Random Finite Sets ◽  
Resolvable Group

In this paper, multiple resolvable group target tracking was considered in the frame of random finite sets. In particular, a group target model was introduced by combining graph theory with the labeled random finite sets (RFS). This accounted for dependence between group members. Simulations were presented to verify the proposed algorithm.

Target Tracking Based on Improved Camshift and Kalman Filter

2014 ◽  
Vol 989-994 ◽  
pp. 3587-3590
Author(s):  
Li Ying Ban ◽  
Yue Hua Han ◽  
Yan Hai Wu
Keyword(s):  
Kalman Filter ◽  
Target Tracking ◽  
Target Object ◽  
Tracking Algorithm ◽  
Color Target ◽  
Motion Cues ◽  
Target Model ◽  
Camshift Algorithm ◽  
Novel Target

A tracking algorithm based on improved Camshift and Kalman filter is proposed in this paper to deal with the problems in traditional Camshift algorithm, such as tracking failure under color interference or occlusion. Firstly, the proposed algorithm improves the single color target model and presents a novel target model, which fuses color and motion cues, to enhance the robustness and accuracy of target tracking. And in order to increase the tracking efficiency, the algorithm combines Kalman filter with the improved Camshift algorithm by using Kalman filter to predict the position of the tracking target under color noises and occlusion. The experiment results demonstrate that the proposed algorithm can track the target object accurately and has better robustness.

Sign in / Sign up

Export Citation Format

Share Document