Moving object trajectory estimation using an optical Fourier processor
pqart关于轨迹的完整操作流程
pqart关于轨迹的完整操作流程英文回答:Complete Workflow for Trajectory Operations in Pqart.1. Data Acquisition.Collect raw trajectory data from various sources, such as GPS, IMU, and radar.Ensure data quality by filtering out noise and outliers.2. Data Preprocessing.Convert raw data into a suitable format for processing.Calibrate and align data to account for sensor biases and offsets.3. Data Fusion.Combine data from multiple sources to create a more accurate representation of the trajectory.Utilize algorithms such as Kalman filtering orparticle filtering for data fusion.4. Trajectory Estimation.Estimate the position, velocity, and acceleration of the object along the trajectory.Employ methods like least squares or cubic splines for trajectory fitting.5. Trajectory Analysis.Characterize the motion of the object based on the estimated trajectory.Calculate parameters such as speed, distance traveled,and trajectory shape.6. Trajectory Prediction.Forecast the future motion of the object based on its previous trajectory.Utilize machine learning or statistical models for prediction.7. Trajectory Visualization.Display the trajectory in a user-friendly format for visualization and analysis.Use tools such as maps or 3D plots for effective visualization.8. Trajectory Optimization.Optimize the trajectory to achieve specific goals, such as minimizing time or energy consumption.Employ optimization algorithms like nonlinear programming or genetic algorithms.中文回答:Pqart中轨迹操作的完整操作流程。
国际自动化与计算杂志.英文版.
国际自动化与计算杂志.英文版.1.Improved Exponential Stability Criteria for Uncertain Neutral System with Nonlinear Parameter PerturbationsFang Qiu,Ban-Tong Cui2.Robust Active Suspension Design Subject to Vehicle Inertial Parameter VariationsHai-Ping Du,Nong Zhang3.Delay-dependent Non-fragile H∞ Filtering for Uncertain Fuzzy Systems Based on Switching Fuzzy Model and Piecewise Lyapunov FunctionZhi-Le Xia,Jun-Min Li,Jiang-Rong Li4.Observer-based Adaptive Iterative Learning Control for Nonlinear Systems with Time-varying DelaysWei-Sheng Chen,Rui-Hong Li,Jing Li5.H∞ Output Feedback Control for Stochastic Systems with Mode-dependent Time-varying Delays and Markovian Jump ParametersXu-Dong Zhao,Qing-Shuang Zeng6.Delay and Its Time-derivative Dependent Robust Stability of Uncertain Neutral Systems with Saturating ActuatorsFatima El Haoussi,El Houssaine Tissir7.Parallel Fuzzy P+Fuzzy I+Fuzzy D Controller:Design and Performance EvaluationVineet Kumar,A.P.Mittal8.Observers for Descriptor Systems with Slope-restricted NonlinearitiesLin-Na Zhou,Chun-Yu Yang,Qing-Ling Zhang9.Parameterized Solution to a Class of Sylvester MatrixEquationsYu-Peng Qiao,Hong-Sheng Qi,Dai-Zhan Cheng10.Indirect Adaptive Fuzzy and Impulsive Control of Nonlinear SystemsHai-Bo Jiang11.Robust Fuzzy Tracking Control for Nonlinear Networked Control Systems with Integral Quadratic ConstraintsZhi-Sheng Chen,Yong He,Min Wu12.A Power-and Coverage-aware Clustering Scheme for Wireless Sensor NetworksLiang Xue,Xin-Ping Guan,Zhi-Xin Liu,Qing-Chao Zheng13.Guaranteed Cost Active Fault-tolerant Control of Networked Control System with Packet Dropout and Transmission DelayXiao-Yuan Luo,Mei-Jie Shang,Cai-Lian Chen,Xin-Ping Guanparison of Two Novel MRAS Based Strategies for Identifying Parameters in Permanent Magnet Synchronous MotorsKan Liu,Qiao Zhang,Zi-Qiang Zhu,Jing Zhang,An-Wen Shen,Paul Stewart15.Modeling and Analysis of Scheduling for Distributed Real-time Embedded SystemsHai-Tao Zhang,Gui-Fang Wu16.Passive Steganalysis Based on Higher Order Image Statistics of Curvelet TransformS.Geetha,Siva S.Sivatha Sindhu,N.Kamaraj17.Movement Invariants-based Algorithm for Medical Image Tilt CorrectionMei-Sen Pan,Jing-Tian Tang,Xiao-Li Yang18.Target Tracking and Obstacle Avoidance for Multi-agent SystemsJing Yan,Xin-Ping Guan,Fu-Xiao Tan19.Automatic Generation of Optimally Rigid Formations Using Decentralized MethodsRui Ren,Yu-Yan Zhang,Xiao-Yuan Luo,Shao-Bao Li20.Semi-blind Adaptive Beamforming for High-throughput Quadrature Amplitude Modulation SystemsSheng Chen,Wang Yao,Lajos Hanzo21.Throughput Analysis of IEEE 802.11 Multirate WLANs with Collision Aware Rate Adaptation AlgorithmDhanasekaran Senthilkumar,A. Krishnan22.Innovative Product Design Based on Customer Requirement Weight Calculation ModelChen-Guang Guo,Yong-Xian Liu,Shou-Ming Hou,Wei Wang23.A Service Composition Approach Based on Sequence Mining for Migrating E-learning Legacy System to SOAZhuo Zhang,Dong-Dai Zhou,Hong-Ji Yang,Shao-Chun Zhong24.Modeling of Agile Intelligent Manufacturing-oriented Production Scheduling SystemZhong-Qi Sheng,Chang-Ping Tang,Ci-Xing Lv25.Estimation of Reliability and Cost Relationship for Architecture-based SoftwareHui Guan,Wei-Ru Chen,Ning Huang,Hong-Ji Yang1.A Computer-aided Design System for Framed-mould in Autoclave ProcessingTian-Guo Jin,Feng-Yang Bi2.Wear State Recognition of Drills Based on K-means Cluster and Radial Basis Function Neural NetworkXu Yang3.The Knee Joint Design and Control of Above-knee Intelligent Bionic Leg Based on Magneto-rheological DamperHua-Long Xie,Ze-Zhong Liang,Fei Li,Li-Xin Guo4.Modeling of Pneumatic Muscle with Shape Memory Alloy and Braided SleeveBin-Rui Wang,Ying-Lian Jin,Dong Wei5.Extended Object Model for Product Configuration DesignZhi-Wei Xu,Ze-Zhong Liang,Zhong-Qi Sheng6.Analysis of Sheet Metal Extrusion Process Using Finite Element MethodXin-Cun Zhuang,Hua Xiang,Zhen Zhao7.Implementation of Enterprises' Interoperation Based on OntologyXiao-Feng Di,Yu-Shun Fan8.Path Planning Approach in Unknown EnvironmentTing-Kai Wang,Quan Dang,Pei-Yuan Pan9.Sliding Mode Variable Structure Control for Visual Servoing SystemFei Li,Hua-Long Xie10.Correlation of Direct Piezoelectric Effect on EAPap under Ambient FactorsLi-Jie Zhao,Chang-Ping Tang,Peng Gong11.XML-based Data Processing in Network Supported Collaborative DesignQi Wang,Zhong-Wei Ren,Zhong-Feng Guo12.Production Management Modelling Based on MASLi He,Zheng-Hao Wang,Ke-Long Zhang13.Experimental Tests of Autonomous Ground Vehicles with PreviewCunjia Liu,Wen-Hua Chen,John Andrews14.Modelling and Remote Control of an ExcavatorYang Liu,Mohammad Shahidul Hasan,Hong-Nian Yu15.TOPSIS with Belief Structure for Group Belief Multiple Criteria Decision MakingJiang Jiang,Ying-Wu Chen,Da-Wei Tang,Yu-Wang Chen16.Video Analysis Based on Volumetric Event DetectionJing Wang,Zhi-Jie Xu17.Improving Decision Tree Performance by Exception HandlingAppavu Alias Balamurugan Subramanian,S.Pramala,B.Rajalakshmi,Ramasamy Rajaram18.Robustness Analysis of Discrete-time Indirect Model Reference Adaptive Control with Normalized Adaptive LawsQing-Zheng Gao,Xue-Jun Xie19.A Novel Lifecycle Model for Web-based Application Development in Small and Medium EnterprisesWei Huang,Ru Li,Carsten Maple,Hong-Ji Yang,David Foskett,Vince Cleaver20.Design of a Two-dimensional Recursive Filter Using the Bees AlgorithmD. T. Pham,Ebubekir Ko(c)21.Designing Genetic Regulatory Networks Using Fuzzy Petri Nets ApproachRaed I. Hamed,Syed I. Ahson,Rafat Parveen1.State of the Art and Emerging Trends in Operations and Maintenance of Offshore Oil and Gas Production Facilities: Some Experiences and ObservationsJayantha P.Liyanage2.Statistical Safety Analysis of Maintenance Management Process of Excavator UnitsLjubisa Papic,Milorad Pantelic,Joseph Aronov,Ajit Kumar Verma3.Improving Energy and Power Efficiency Using NComputing and Approaches for Predicting Reliability of Complex Computing SystemsHoang Pham,Hoang Pham Jr.4.Running Temperature and Mechanical Stability of Grease as Maintenance Parameters of Railway BearingsJan Lundberg,Aditya Parida,Peter S(o)derholm5.Subsea Maintenance Service Delivery: Mapping Factors Influencing Scheduled Service DurationEfosa Emmanuel Uyiomendo,Tore Markeset6.A Systemic Approach to Integrated E-maintenance of Large Engineering PlantsAjit Kumar Verma,A.Srividya,P.G.Ramesh7.Authentication and Access Control in RFID Based Logistics-customs Clearance Service PlatformHui-Fang Deng,Wen Deng,Han Li,Hong-Ji Yang8.Evolutionary Trajectory Planning for an Industrial RobotR.Saravanan,S.Ramabalan,C.Balamurugan,A.Subash9.Improved Exponential Stability Criteria for Recurrent Neural Networks with Time-varying Discrete and Distributed DelaysYuan-Yuan Wu,Tao Li,Yu-Qiang Wu10.An Improved Approach to Delay-dependent Robust Stabilization for Uncertain Singular Time-delay SystemsXin Sun,Qing-Ling Zhang,Chun-Yu Yang,Zhan Su,Yong-Yun Shao11.Robust Stability of Nonlinear Plants with a Non-symmetric Prandtl-Ishlinskii Hysteresis ModelChang-An Jiang,Ming-Cong Deng,Akira Inoue12.Stability Analysis of Discrete-time Systems with Additive Time-varying DelaysXian-Ming Tang,Jin-Shou Yu13.Delay-dependent Stability Analysis for Markovian Jump Systems with Interval Time-varying-delaysXu-Dong Zhao,Qing-Shuang Zeng14.H∞ Synchronization of Chaotic Systems via Delayed Feedback ControlLi Sheng,Hui-Zhong Yang15.Adaptive Fuzzy Observer Backstepping Control for a Class of Uncertain Nonlinear Systems with Unknown Time-delayShao-Cheng Tong,Ning Sheng16.Simulation-based Optimal Design of α-β-γ-δ FilterChun-Mu Wu,Paul P.Lin,Zhen-Yu Han,Shu-Rong Li17.Independent Cycle Time Assignment for Min-max SystemsWen-De Chen,Yue-Gang Tao,Hong-Nian Yu1.An Assessment Tool for Land Reuse with Artificial Intelligence MethodDieter D. Genske,Dongbin Huang,Ariane Ruff2.Interpolation of Images Using Discrete Wavelet Transform to Simulate Image Resizing as in Human VisionRohini S. Asamwar,Kishor M. Bhurchandi,Abhay S. Gandhi3.Watermarking of Digital Images in Frequency DomainSami E. I. Baba,Lala Z. Krikor,Thawar Arif,Zyad Shaaban4.An Effective Image Retrieval Mechanism Using Family-based Spatial Consistency Filtration with Object RegionJing Sun,Ying-Jie Xing5.Robust Object Tracking under Appearance Change ConditionsQi-Cong Wang,Yuan-Hao Gong,Chen-Hui Yang,Cui-Hua Li6.A Visual Attention Model for Robot Object TrackingJin-Kui Chu,Rong-Hua Li,Qing-Ying Li,Hong-Qing Wang7.SVM-based Identification and Un-calibrated Visual Servoing for Micro-manipulationXin-Han Huang,Xiang-Jin Zeng,Min Wang8.Action Control of Soccer Robots Based on Simulated Human IntelligenceTie-Jun Li,Gui-Qiang Chen,Gui-Fang Shao9.Emotional Gait Generation for a Humanoid RobotLun Xie,Zhi-Liang Wang,Wei Wang,Guo-Chen Yu10.Cultural Algorithm for Minimization of Binary Decision Diagram and Its Application in Crosstalk Fault DetectionZhong-Liang Pan,Ling Chen,Guang-Zhao Zhang11.A Novel Fuzzy Direct Torque Control System for Three-level Inverter-fed Induction MachineShu-Xi Liu,Ming-Yu Wang,Yu-Guang Chen,Shan Li12.Statistic Learning-based Defect Detection for Twill FabricsLi-Wei Han,De Xu13.Nonsaturation Throughput Enhancement of IEEE 802.11b Distributed Coordination Function for Heterogeneous Traffic under Noisy EnvironmentDhanasekaran Senthilkumar,A. Krishnan14.Structure and Dynamics of Artificial Regulatory Networks Evolved by Segmental Duplication and Divergence ModelXiang-Hong Lin,Tian-Wen Zhang15.Random Fuzzy Chance-constrained Programming Based on Adaptive Chaos Quantum Honey Bee Algorithm and Robustness AnalysisHan Xue,Xun Li,Hong-Xu Ma16.A Bit-level Text Compression Scheme Based on the ACW AlgorithmHussein A1-Bahadili,Shakir M. Hussain17.A Note on an Economic Lot-sizing Problem with Perishable Inventory and Economies of Scale Costs:Approximation Solutions and Worst Case AnalysisQing-Guo Bai,Yu-Zhong Zhang,Guang-Long Dong1.Virtual Reality: A State-of-the-Art SurveyNing-Ning Zhou,Yu-Long Deng2.Real-time Virtual Environment Signal Extraction and DenoisingUsing Programmable Graphics HardwareYang Su,Zhi-Jie Xu,Xiang-Qian Jiang3.Effective Virtual Reality Based Building Navigation Using Dynamic Loading and Path OptimizationQing-Jin Peng,Xiu-Mei Kang,Ting-Ting Zhao4.The Skin Deformation of a 3D Virtual HumanXiao-Jing Zhou,Zheng-Xu Zhao5.Technology for Simulating Crowd Evacuation BehaviorsWen-Hu Qin,Guo-Hui Su,Xiao-Na Li6.Research on Modelling Digital Paper-cut PreservationXiao-Fen Wang,Ying-Rui Liu,Wen-Sheng Zhang7.On Problems of Multicomponent System Maintenance ModellingTomasz Nowakowski,Sylwia Werbinka8.Soft Sensing Modelling Based on Optimal Selection of Secondary Variables and Its ApplicationQi Li,Cheng Shao9.Adaptive Fuzzy Dynamic Surface Control for Uncertain Nonlinear SystemsXiao-Yuan Luo,Zhi-Hao Zhu,Xin-Ping Guan10.Output Feedback for Stochastic Nonlinear Systems with Unmeasurable Inverse DynamicsXin Yu,Na Duan11.Kalman Filtering with Partial Markovian Packet LossesBao-Feng Wang,Ge Guo12.A Modified Projection Method for Linear FeasibilityProblemsYi-Ju Wang,Hong-Yu Zhang13.A Neuro-genetic Based Short-term Forecasting Framework for Network Intrusion Prediction SystemSiva S. Sivatha Sindhu,S. Geetha,M. Marikannan,A. Kannan14.New Delay-dependent Global Asymptotic Stability Condition for Hopfield Neural Networks with Time-varying DelaysGuang-Deng Zong,Jia Liu hHTTp://15.Crosscumulants Based Approaches for the Structure Identification of Volterra ModelsHouda Mathlouthi,Kamel Abederrahim,Faouzi Msahli,Gerard Favier1.Coalition Formation in Weighted Simple-majority Games under Proportional Payoff Allocation RulesZhi-Gang Cao,Xiao-Guang Yang2.Stability Analysis for Recurrent Neural Networks with Time-varying DelayYuan-Yuan Wu,Yu-Qiang Wu3.A New Type of Solution Method for the Generalized Linear Complementarity Problem over a Polyhedral ConeHong-Chun Sun,Yan-Liang Dong4.An Improved Control Algorithm for High-order Nonlinear Systems with Unmodelled DynamicsNa Duan,Fu-Nian Hu,Xin Yu5.Controller Design of High Order Nonholonomic System with Nonlinear DriftsXiu-Yun Zheng,Yu-Qiang Wu6.Directional Filter for SAR Images Based on NonsubsampledContourlet Transform and Immune Clonal SelectionXiao-Hui Yang,Li-Cheng Jiao,Deng-Feng Li7.Text Extraction and Enhancement of Binary Images Using Cellular AutomataG. Sahoo,Tapas Kumar,B.L. Rains,C.M. Bhatia8.GH2 Control for Uncertain Discrete-time-delay Fuzzy Systems Based on a Switching Fuzzy Model and Piecewise Lyapunov FunctionZhi-Le Xia,Jun-Min Li9.A New Energy Optimal Control Scheme for a Separately Excited DC Motor Based Incremental Motion DriveMilan A.Sheta,Vivek Agarwal,Paluri S.V.Nataraj10.Nonlinear Backstepping Ship Course ControllerAnna Witkowska,Roman Smierzchalski11.A New Method of Embedded Fourth Order with Four Stages to Study Raster CNN SimulationR. Ponalagusamy,S. Senthilkumar12.A Minimum-energy Path-preserving Topology Control Algorithm for Wireless Sensor NetworksJin-Zhao Lin,Xian Zhou,Yun Li13.Synchronization and Exponential Estimates of Complex Networks with Mixed Time-varying Coupling DelaysYang Dai,YunZe Cai,Xiao-Ming Xu14.Step-coordination Algorithm of Traffic Control Based on Multi-agent SystemHai-Tao Zhang,Fang Yu,Wen Li15.A Research of the Employment Problem on Common Job-seekersand GraduatesBai-Da Qu。
Simultaneous localization and mapping (SLAM) part II
S
long excursion, the so-called loop-closure problem. The data association section surveys current data association methods used in SLAM. These include batch-validation methods that exploit constraints inherent in the SLAM formulation, appearance-based methods, and multihypothesis techniques. The third development discussed in this tutorial is the trend towards richer appearance-based models of landmarks and maps. While initially motivated by problems in data association and loop closure, these methods have resulted in qualitatively different methods of describing the SLAM problem, focusing on trajectory estimation rather than landmark estimation. The environment representation section surveys current developments in this area along a number of lines, including delayed mapping, the use of nongeometric landmarks, and trajectory estimation methods. SLAM methods have now reached a state of considerable maturity. Future challenges will center on methods enabling large-scale implementations in increasingly unstructured environments and especially in situations where GPS-like solutions are unavailable or unreliable: in urban canyons, under foliage, under water, or on remote planets.
一种基于物体追踪的改进语义SLAM_算法
第 22卷第 10期2023年 10月Vol.22 No.10Oct.2023软件导刊Software Guide一种基于物体追踪的改进语义SLAM算法杜小双,施展,华云松(上海理工大学光电信息与计算机工程学院,上海 200093)摘要:在视觉同步定位与建图(SLAM)算法中,使用语义分割和目标检测以剔除异常点的方法成为主流,但使用中无法对物体语义信息进行充分追踪。
为此,提出一种基于物体追踪的改进语义SLAM算法,通过YOLACT++网络分割物体掩码,提取物体特征点后,利用帧间匹配实现物体追踪。
该方法对匹配特征点进行深度、重投影误差和极线约束三重检测后判断物体动静态,实现物体追踪并判断运动状态。
通过对TUM RGB-D数据集测试,实验表明该方法可有效追踪物体,且轨迹估计精度优于其他SLAM算法,具有较好实用价值。
关键词:视觉SLAM;语义分割;物体追踪;动态场景;几何约束DOI:10.11907/rjdk.222298开放科学(资源服务)标识码(OSID):中图分类号:TP301 文献标识码:A文章编号:1672-7800(2023)010-0205-06 An Improved Semantic SLAM Algorithm Based on Object TrackingDU Xiaoshuang, SHI Zhan, HUA Yunsong(School of Optical-Electrical and Computer Engineering,University of Shanghai for Science and Technology,Shanghai 200093,China)Abstract:In the visual SLAM (simultaneous localization and mapping), the method of using semantic segmentation and object detection to detect dynamic objects and remove outliers has become the mainstream, but its disadvantage is that it is unable to fully track the semantic in⁃formation of objects. Therefore, this paper proposes an improved semantic SLAM algorithm based on object tracking, which uses YOLACT++ network to segment object mask, extract object feature points, and use inter frame matching to achieve object tracking. The method detects the depth, reprojection error and epipolar constraint of the matched feature points, and then judges the dynamic and static state of the object to achieve object tracking and judge the motion state. After testing the TUM RGB-D dataset, the experiment shows that the method can effective⁃ly track objects, and the trajectory estimation accuracy is better than other SLAM algorithms, which has practical value.Key Words:visual SLAM; semantic segmentation; object tracking; dynamic environment; geometric constraint0 引言随着机器人技术、无人驾驶、增强现实等领域的发展与普及,视觉SLAM作为其应用的基础技术之一[1],得到了学者们的广泛关注与研究,并成为机器人定位与建图研究领域的一个热点[2]。
轨迹数据挖掘-介绍
Batch Compression Douglas-Peucker (DP) Algorithm
• Preserve directional trends in the approximated trajectory using the perpendicular Euclidean distance as the error measure.
Chapter 1 Trajectory Preprocessing
Wang-Chien Lee Pennsylvania State University University Park, PA USA John Krumm Microsoft Research Redmond, WA USA
Location-Based Services
Open Window
• Different from the sliding window, choose location points with the highest error in the sliding window as the closing point of the approximating line segment as well as the new anchor point. • When p4 is included, the error for p2 exceeds the threshold, so p0p2 is included in the approximate trajectory and p2 is set as the anchor to continue.
Joke
The one about the guy who joins a monastery
自动驾驶 曲率相关公式
自动驾驶曲率相关公式Autonomous driving technology has advanced rapidly in recent years, with numerous companies investing significant resources in developing self-driving systems. One crucial aspect of autonomous driving is the ability to accurately predict and navigate through curves on the road. This requires a thorough understanding of the curvature-related formulas that govern the dynamics of a moving vehicle.在过去几年中,自动驾驶技术发展迅速,许多公司投入了大量资源来开发自动驾驶系统。
自动驾驶的一个关键方面是能够准确预测和驾驶车辆通过道路上的曲线。
这需要对控制车辆运动动力学的曲率相关公式有深入的理解。
One essential curvature-related formula is the calculation of the radius of curvature, which determines how sharply or gently a curve bends. The radius of curvature is defined as the reciprocal of the curvature and is crucial for understanding the trajectory of a moving vehicle as it navigates through curves. In autonomous driving systems, accurate estimation of the radius of curvature is essentialfor safe and efficient navigation.一个重要的曲率相关公式是曲率半径的计算,它决定了一条曲线的弯曲程度。
目标跟踪任务基本流程
目标跟踪任务基本流程Target tracking is an essential task in many fields, including surveillance, robotics, and computer vision. 目标跟踪是许多领域的重要任务,包括监视、机器人技术和计算机视觉。
It involves locating and following a specific object or person as it moves through a dynamic environment. 它涉及在动态环境中定位和跟踪特定的对象或人。
The basic flow of target tracking typically includes the following steps: initialization, detection, estimation, association, prediction, and update. 目标跟踪的基本流程通常包括以下步骤:初始化、检测、估计、关联、预测和更新。
Each step plays a crucial role in ensuring the accuracy and efficiency of the tracking process. 每个步骤在确保跟踪过程的准确性和效率方面发挥着关键作用。
The first step in the target tracking process is initialization, where the algorithm identifies and initializes the target to be tracked. 目标跟踪过程中的第一步是初始化,算法识别和初始化要跟踪的目标。
This step is vital as it sets the starting point for the tracking system and establishes the initial conditions for further analysis. 这一步骤非常重要,因为它为跟踪系统设定了起点,并建立了进一步分析的初始条件。
trajectory analysis
trajectory analysisTrajectory analysis is the process of measuring, modeling and analyzing the movement of objects over time. It is used in many fields such as transportation, logistics, geography, ecology and economics to study the behavior of a variety of entities including people, animals, vehicles, airplanes, ships and containers.The goal of trajectory analysis is to gain insight into the patterns and trends of anobject’s movement over time. This type of analysis has been used to analyze the movements of migratory birds, track the spread of infectious diseases, monitor traffic flow, and study the migration of refugees.Data used in trajectory analysis can be collected from a variety of sources such as GPS, remote sensing, video surveillance, cell phone location data, or sensor networks. Data collection methods depend on the type of object being tracked and the purpose of the analysis.Once the data has been collected, it must be pre-processed to ensure accuracy and consistency. This includes cleaning the data to remove any erroneous or missing values, transforming the data into standard formats, and interpolating points to fill in any gaps. The pre-processed data then needs to be analyzed using a variety of techniques such as time series analysis, cluster analysis, and spatial analysis.Time series analysis is used to analyze how an entity’s position changes over time. This technique is useful for studying long-term trends, such as population movements or commuting patterns. Cluster analysis can be used to identify patternsin trajectories by grouping them into clusters based on similarity. Spatial analysis is used to identify patterns in the spatial distribution of trajectories, such as the density of particular areas or the distribution of objects across space.Once the data has been analyzed, the results can be used to draw conclusions about the object’s movement over time. This could include identifyingpatterns in the data, predicting future movements, and determining the most efficient routes. The results can also be used to improve existing processes and make decisions about future activities.Trajectory analysis is an important tool for understanding the movement of objects over time, allowing us to draw insights into the patterns and trends of their behavior. By utilizing the power of modern data collection technologies, trajectory analysis can help us to better understand the behavior of people, animals, and objects and make more informed decisions.。
获取移动信标避障轨迹定位点(IJCNIS-V2-N1-7)
I.J. Computer Network and Information Security, 2010, 1, 45-51Published Online November 2010 in MECS (/)Getting Obstacle Avoidance Trajectory of MobileBeacon for LocalizationHuan-Qing CUIShandong University of Science and Technology, Qingdao, ChinaEmail: cuihuanqing@Ying-Long WANGShandong Provincial Key Laboratory of Computer Networks, Shandong Computer Science Center, Jinan, ChinaEmail: wangyl@Qiang GUOShandong Economic University, Jinan, ChinaEmail: guoqiang_sd@Nuo WEIShandong Provincial Key Laboratory of Computer Networks, Shandong Computer Science Center, Jinan, ChinaEmail: wein@Abstract—Localization is one of the most important technologies in wireless sensor network, and mobile beacon assisted localization is a promising localization method. The mobile beacon trajectory planning is a basic and important problem in these methods. There are many obstacles in the real world, which obstruct the moving of mobile beacon. This paper focuses on the obstacle avoidance trajectory planning scheme. After partitioning the deployment area with fixed cell decomposition, the beacon trajectory are divided into global and local trajectory. The approximate shortest global trajectory is obtained by depth-first search, greedy strategy method and ant colony algorithm, while local trajectory is any existing trajectories. Simulation results show that this method can avoid obstacles in the network deployment area, and the smaller cell size leads to longer beacon trajectory and more localizable sensor nodes. Index Terms—wireless sensor network, mobile beacon, obstacle avoidance, fixed cell decomposition, localizationI.I NTRODUCTIONIn many application areas of wireless sensor networks, such as object tracking, environment monitoring, health perception and ship navigation, the location information is critically essential and indispensable for it provides meaningful sensor data. Moreover, location information supports many fundamental network services including routing, topology and coverage control and so on [1].The localization methods are classified into beacon-based or beacon-free. The beacon-based localization method needs some special sensor nodes (a.k.a. anchors or beacons or landmarks) know their global locations and the rest nodes (a.k.a. unknown nodes) determine locations by measuring the geographic information (e.g., distance or angle), which produces an absolute coordinate system. The beacon-free localization method is based on the network topology and produces a relative coordinate system. The former provides more precise position than the latter, but it is more expensive.To decrease cost and keep accuracy of beacon-based localization methods, mobile beacon assisted localization algorithms are introduced and become promising. This method utilizes a mobile beacon to traverse the network deployment area to generate virtual beacons, and the unknown nodes estimate their locations with received virtual beacon positions. It is a basic and interesting problem in this method to obtain the optimal mobile beacon trajectory. The existing trajectory planning methods often suppose the network deployment area is obstacle-free, but there are many obstacles in real world, such as trees, rocks, holes. Therefore, this paper focuses on the planning of obstacle avoidance trajectory for mobile beacon.The rest of the paper is organized as follows: Section II surveys various mobile beacon assisted localization and beacon trajectory-planning methods. Section III gives the obstacle-avoidance path planning method via fixed cell decomposition. Section IV describes the simulation and analyzes the results, and Section V concludes the paper.II.R ELATED W ORKSIn beacon-based localization methods, the beacons are more expensive than unknown nodes. To reduce the number of static beacons, a mobile beacon is used to replace static beacons.A. Mobile Beacon Assisted Localization MethodsThe mobile beacon assisted localization methods can be classified as range-based and range-free, deterministic and probabilistic etc.The range-based methods require the unknown nodes measure the distance to virtual beacons, and estimate their locations with trilateration or multilateration. Ref. [2] proposed a method using TDOA (Time Difference of46Getting Obstacle Avoidance Trajectory of Mobile Beacon for LocalizationArrival) of RF (Radio Frequency) and ultrasonic signal to range the distance and trilateration to estimate locations. MAL (Mobile Assisted Localization)[3] method employs a mobile user to assist in measuring distances between node pairs until these distance constraints form a “globally rigid” structure that guarantees a unique localization. The above are deterministic methods, and there are some probabilistic methods. Ref. [4] presented a method based on RSSI (Received Signal Strength Indicator) where the sensor nodes receiving beacon packets infer proximity constraints to the mobile beacon and use them to construct and maintain position estimates. The range-free method estimates the unknown nodes with area or borderline measurement technology. The area measurement determines the area where unknown nodes located, and uses the centroid or weighted centroid as the location estimation. ADO (Arrival and Departure Overlap) algorithm [5] determines the arrival and departure area using a mobile beacon and estimates unknown nodes’ locations with centroid. Ref. [6] proposed a method based on geometric constraints utilizing three reference points. ADAL (Azimuthally Defined Area Localization) algorithm [7] uses a mobile beacon node equipped with a rotary directional antenna to determine the area.The basic idea of borderline measurement is to determine two or more lines where an unknown node locates, and estimate its location as the cross point of these borderlines. Ref. [8] described a localization scheme using the conjecture of perpendicular bisector of a chord, which selects three virtual beacons to generate two perpendicular bisectors of chord and estimate locations. PI (Perpendicular Intersection) algorithm [9] is a similar method with different line-measurement method. The directional antenna and multi-power level mobile beacon can improve the localization accuracy [10, 11]. The probabilistic range-free schemes [12, 13] are based on SMC (Sequential Monte Carlo) method, which is composed of prediction and filter phases.B. Mobile Beacon Trajectory Planning MethodsThe traversal trajectory of the beacon in the deployment area is an interesting and basic problem to improve the localization performance. Ref. [4] presented some properties that the trajectory should have:(1) The trajectory of the beacon should pass closely to as many potential node positions as possible for a node is best localized if the beacon is close to it.(2) In two-dimension, the trajectory should ensure every node to be localized can receive at least three non-collinear beacon packets.Furthermore, the trajectory should be as short as possible to be economic [14].The trajectory planning schemes can be categorized into static and dynamic path planning method. The static method plans the mobile beacon trajectory before localization phase, and the beacon must follow the pre-defined trajectory during traversing the region. The RWP (Random Waypoint) model is usually used as the beacon trajectory [6, 12, 13]. In RWP model, the mobile beacon moves along a zigzag line from one waypoint to the next, and the waypoints are uniformly distributed over the given network deployment area. At the start of each leg, a random velocity is drawn from the velocity distribution (in the basic case the velocity is constant 1).The RWP model cannot cover the entire network deployment region, which leads to some unknown nodes cannot be localized. In order to overcome this drawback, some deterministic trajectories are proposed. Three trajectories named by S CAN, D OUBLE-S CAN and H ILBERT are studied in [15]. S CAN is a simple and easily implemented trajectory composing of straight lines along one dimension, D OUBLE-S CAN is to scan the network along both directions, and H ILBERT is Hilbert filling curve. The simulation results showed that any deterministic trajectory that covers the whole area offer significant benefits compared to a random movement of the beacon. The localization algorithm with H ILBERT as trajectory of beacon is investigated in [16], it defined the minimum Hilbert curve order that ensure the localization of all the unknown nodes, and claimed that the beacon must send its packets at every Hilbert key position.Since straight lines invariably introduce collinearity, Ref. [17] designed C IRCLES which consists of a sequence of concentric circles centered within the deployment area, and S-C URVES which is based on S CAN with ‘S’ curve instead of straight line.To reduce beacon density and trajectory length, Ref.[18] proposed K-coverage trajectory that is designed to focus on the virtual beacon deployment and the shortest touring path obtainment, and a virtual force trajectory that is designed according to virtual force on mobile beacon that is exerted by unknown nodes. For the same reason, Ref. [14] deduced the number of virtual beacons according to the acreage of ROI (region of interest), and presented a method based on wandering sales representative problem algorithm to get the optimal path. Regarding the wireless sensor network as a connected undirected graph, the path-planning problem is translated into having a spanning tree and traversing graph. Ref. [19] proposed breadth first and backtracking greedy algorithms for spanning tree to get the optimal trajectory. The dynamic path planning methods try to give a real-time direction and step length of mobile beacon when it moves in the region. Ref. [20] provided a novel heuristic dynamic path planning method based on received-beacon numbers of ordinary nodes and deployed nodes in different regions using the directional antenna technology. Besides the above trajectory planning method independent of localization algorithm, some localization schemes need special trajectory. For example, PI algorithm [9] requires the beacon to move in triangles.All these methods supposed the deployment area is obstacle-free, they do not consider obstacle avoidance function when they planed the trajectory. However, there are many kinds of obstacles that the ground mobile beacon should avoid, thus this paper focuses on the obstacle avoidance trajectory-planning problem. The obstacle-avoidance routing protocol in sensor networks has been studied [21], which aimed at giving a shortest-path geographic routing in static sensor network using visibility-graph-based routing protocol.III.O BSTACLE A VOIDANCE P ATH P LANNINGIn robotics, the obstacle avoidance coverage path planning has been well-studied [22], and visibility graph and cell decomposition are two main methods. The main goals of path planning in robotics are to provide a shortest path cover a predefined area and avoid any obstacle along the path. For the trajectory planning of mobile beacon in wireless sensor network, the beacon need not cover all point of the deployment region while only need provide enough virtual beacons for each unknown node to localize [15].A. Fixed Cell DecompositionCell decomposition is to partition a given region into disjoint sets, and let the robot travel the obstacle-free elements of the sets. Using the concepts in the field of robotics for reference, we introduce some terms and notions in first.The deployment area of sensor network is configuration space C, and the obstacle-free part of C is denoted as C free, the complement of C free is C obst. Each element of the disjoint sets after decomposition is called a cell, and a cell is called empty when it is in C free, and it is full when it is in C obst, and otherwise it is mixed. Cell decomposition method can be classified as exact and approximate. The idea of exact cell decomposition is to decompose C free into a collection of non-overlapping cells such that the union of all the empty cells exactly equals C free. On the contrary, approximate cell decomposition is to construct a collection of non-overlapping cells such that the union of all the empty cells approximately covers C free. If all cells have equal size, it is fixed cell decomposition; otherwise, it is adaptive cell decomposition. After decomposition, C free can be mapped into connectivity graph G that is an undirected graph whose vertices correspond to empty cells and vertices connected by edge if and only if corresponding cells are adjacent. Note that, for a cell, not only the cells sharing common edges with it are adjacent cells (Fig.1(a)), but the four diagonal cells are adjacent as Fig.1(b).This paper studies the obstacle avoidance trajectory planning with fixed cell decomposition, and the other methods will be discussed in future. For simplicity, we assume that:(1) The mobile beacon can be modeled as a point, thus the beacon can move freely in any size of empty cell. (2) All the full and mixed cells will not be contained in the trajectory.(3) C free is a continuous region, i.e., there is not any obstacle partitioning C into two disjoint parts. Consequently, the corresponding connected graph G is really connected (any pair of vertices of G have a path). This assumption implies that all the obstacles are solid. (4) The cell decomposition uses square as cell shape. The trajectory among empty cells is named by global trajectory, and that within each empty cell is local trajectory. The trajectory consists of global and local trajectory is called complete trajectory.B. Global Trajectory Planning with Depth First Search Since the deployment area is modeled by a connectivity graph G after cell decomposition, the global trajectory-planning problem is to present a shortest path traversing all vertices of G. We can use depth-first search to solve this problem. Suppose G=(V,E) where V={v i|i=1,2,…,n} and E={e j|j=1,2,…,m}, algorithm 1 describes this method.Algorithm 1:GLOBAL T RAJECTORY P LANNING WITHD EPTH F IRST S EARCHInput: connectivity graph G=(V,E)Output: global trajectory Pprocedure DFS(G)1:for i=1 to n2: visit(i)=false; parent(i)=0;3:end for4:curr=1; visit(1)=true; vn=1; P=Φ;5:while vn<n6:S={v(j) |(v(curr),v(j))∈E and visit(j)=false};7: if S≠Φ8:v(k)=any element of S;9:P=P∪{(v(curr),v(k)};10: parent(k)=curr;11: vn=vn+1;12: visit(k)=true;13: curr=k;14:else15:P=P∪{v(curr),v(parent(curr))};16: curr=parent(curr);17: end if18:end whileend procedureTaking the number of adjacent cells into account, we adopt greedy strategy method to find an approximate shortest path. The basic idea of the greedy method is to make the path containing as less backtrack as possible. After visiting a vertex, the next vertex to visit is the one with the most adjacent and non-visited vertices. Algorithm 2 describes this method.Figure 1. Adjacency definition. Algorithm 2:GLOBAL T RAJECTORY P LANNING WITHG REEDY S TRATEGYInput: connectivity graph G=(V,E)Output: global trajectory Pprocedure Greedy(G)1:for i=1 to n2: visit(i)=false;3: parent(i)=0;4: degree(i)=degree of v(i);5:end for6:degree(curr)=min{degree(i)|v(i)∈V};7:visit(curr)=true;8:vn=1; P=Φ;9:for i=1 to n10:if (v(i),v(curr))∈E11: degree(i)=degree(i)-1;12:end if13:end for14:while vn<n15:S={v(j)|(v(curr),v(j))∈E and visit(j)=false};16:if S≠Φ17: degree(k)=min{degree(i)|v(i)∈S};18:P=P∪{(v(curr),v(k)};19: parent(k)=curr;20: vn=vn+1;21: visit(k)=true;22: curr=k;23: for i=1 to n24:if (v(i),v(curr))∈E and visit(i)=false25: degree(i)=degree(i)-1;26:end if27:end for28:else29:P=P∪{v(curr),v(parent(curr))};30: curr=parent(curr);31:end if32:end whileend procedureThe vertex with minimal degree is the vertex to visit firstly (line 6,7), and the degree of vertices adjacent to current visiting vertex is decreased by 1(line 9-13, 23-27). If the current visiting vertex v(curr) has no non-visited neighbors, the algorithm backtracks to its parent vertex (line 29-30); otherwise, selects the non-visited neighbor with minimal degree to visit (line17-22).C. Global Trajectory Planning with AC AlgorithmThe goal of global trajectory is to give the shortest path traversing each vertex, so we can regard it as TSP (Traveling Salesman Problem), which is a NP-hard problem. Ant colony (AC) algorithm can solve TSP well [23], so we can use ant colony algorithm to plan the global trajectory. However, the connectivity graph G may not have Hamilton cycle, so the shortest global trajectory may contain backtracks. Algorithm 3 presents this method, which is an ant-cycle algorithm with m=n ants. Algorithm 3: G LOBAL T RAJECTORY P LANNING WITH A NTC OLONY A LGORITHMInput: connectivity graph G=(V,E), maximum number of iteration iter_max and parameters α, β, ρ, Q Output: global trajectory Pprocedure ACA(G,α,β,ρ,Q,iter_max,)1:for i=1 to n2:tabu(i,1)=i;3:for j=1 to n4:dis(i,j)=distance between v(i) and v(j); 5:η(i,j)=1/dis(i,j); τ(i,j)=1;6: visit(i,j)=false; Δτ(i,j)=1;7:end for8:visit(i,i)=true;9:end for10:while iter<=iter_max11: for i=2 to n//for the other n-1 vertices12: for j=1 to n// for all the ants13: r=i-1; u=tabu(j,r); tp=0;14:S={k|visit(j,k)=false and dis(u,k)<∞}; 15:while length(S)==016: r=r-1; u=tabu(j,r);17:S={k|visit(j,k)=false and dis(u,k)<∞}; 18:end while19:for k=1 to length(S)20: p(k)= η(u,S(k))βτ(u,S(k))α;21: tp=tp+p(k);22:end for23:for k=1 to length(S)24: p(k)=p(k)/tp;25:end for26: p(v)=max{p(k)|S(k)∈S};27: tabu(j,i)=S(v);28: end for29: end for30: for i=1 to n31:len(i)=0;32: for j=1 to n-133: if dis(tabu(i,j),tabu(i,j+1))<∞34:len(i)=len(i)+dis(tabu(i,j),tabu(i,j+1));35: else36: for k=j-1 to 1 step -137: if dis(tabu(i,k),tabu(i,j+1)) <∞38:len(i)=len(i)+dis(tabu(i,k),tabu(i,k+1)); 39: else40: break;41: end if42: end for43: end if44:len(i)=len(i)+dis(tabu(i,j),tabu(i,j+1));45: end for46: end for47:k=min{len(i)|i=1,2,…,n};48:for j=2 to n49:if dis(tabu(k,j),tabu(k,j-1))<∞50:P=P∪{tabu(k,j),tabu(k,j-1)};51:else52:for i=j-1 to 1 step -153:if dis(tabu(k,j),tabu(k,i))<∞54:break;55:else56:P=P∪{tabu(k,j),tabu(k,j-1)};57:end for58:P=P∪{tabu(k,j),tabu(k,i)};59:end if60:end for61:for i=1 to n62:for j=1 to n-163: u= tabu(i,j); v= tabu(i,j+1);64:Δτ(u,v)= Δτ(u,v)+Q/len(i);65:end for66:end for67:for i=1 to n68:for j=1 to n69:τ(i,j)=ρτ(i,j)+ Δτ(i,j);70: tabu(i,j)=0;71:end for72:end for73: iter=iter+1;74:end whileend procedureInitially, the ant k(k=1,2,…,n) is on the vertex v(k) (line 2). Then, ant k selects the next vertex to visit according to the pheromone amount on the corresponding edge and transition probability p of each vertex (line 13-27). After all ants visiting the entire graph (line 11-29), the length of each traversing path is computed (line 30-46). Then, the shortest path is chosen (line 47-60) to update the global pheromone amount (line 61-72). The approximate shortest path is obtained after iter_max iterations (line 10-74).D. Complete Trajectory PlanningThe local trajectory can utilize any existing path, such as S CAN, H ILBERT, etc. Combining the global and local trajectory, algorithm 4 presents the complete trajectory planning method. Because the global trajectory excludes mixed and full cells, the complete trajectory can avoid obstacles.Algorithm 4: C OMPLETE T RAJECTORY P LANNINGInput: configuration space COutput: obstacle avoidance trajectoryprocedure CTP(C)1:Decomposing C with fixed cell decomposition2:Mapping C free to G3:Obtaining global trajectory by algorithm 1/2/34:repeat5: Localizing the nodes in current empty cell6: Moving to next cell along the global trajectory7:while this empty cell is localized8: Moving to its parent cell on the global trajectory 9:end while10:until all the empty cells are localizedend procedureIV.P ERFORMANCE E VALUATIONA. Simulation SetupWe use Matlab 7.0 to simulate above algorithms. Since localization precision results from the localization method and local trajectory, we only focus on analyzing the trajectory length and number of localizable sensor nodes. For simplicity, we assume that:(1) The configuration space C is a square. If it is not a square, we can expand it by a circum-square to represent the area approximately. The cell shape can be square. (2) The obstacles are all solid polygons, then each obstacle can be denoted by a series of vertices (x i,y i), where x i, y i are the X- and Y-coordinate of i th vertex of aobstacle respectively.(3) All the unknown nodes can be localized located inany empty cell.The configuration space C as the experimental environment is Fig.2(a), which is a 500*500m2 spacewith 300 sensor nodes, and 33 nodes are in C obst(whitehollow dots) while others are in C free (black solid dots).The black polygons are obstacles. The cell size is50*50m2, 25*25m2, 20*20m2 respectively. The parameters of ant colony algorithm are α=0.5, β=1, ρ=0.9,Q=2, iter_max= 20.B. Simulation Results and AnalysisAs an example, Fig.2(b) illustrates the decompositionresult with cell 25*25m2, where the white cells are emptyand black cells are mixed or full. The connectivity graphG and corresponding global trajectories obtained byalgorithm 1-3 are Fig. 3-5 respectively. The ‘*’ denotesthe vertex to be visited first, and ‘∆’ denotes the vertex tobe visited at the end. The black dots are vertices. Thedouble lines of global trajectories are backtracks.(1) Localizable unknown nodes in one-hop range. Thenumber of localizable unknown nodes in one-hop rangereflects the coverage of the mobile beacon trajectory.Because the mobile beacon will not traverse the mixedand full cells, only the unknown nodes in empty cells canbe localized.The unknown nodes in C obst are useless nodes, for theycannot provide useful information; the others are usefulnodes. Table 1 gives the numerical results. With thedecrease of cell size, the number of empty cells andlocalizable unknown nodes increase rapidly.There are 33 useless nodes in our simulation. When thecell size is 50*50m2, the complete trajectory can localize74.5% useful nodes. If the cell is 20*20m2, some originalmixed cells become empty, and 91% useful nodes are localizable.(2) Trajectory length. The trajectory should be as shortas possible to save energy of mobile beacon. If the connectivity graph G has a Hamilton path, its length is:(1)()1optiLen n l=−where n is the number of empty cells, and l is the distancebetween a pair of adjacent empty cells which equals thecell size. Len opti is also the lower bound of the globaltrajectory length.If G has no a Hamilton path, the global trajectory mustcontain some backtracks. Therefore, its length is:()1globalLen n m l=−+ (2) where m is the number of backtracks.Suppose the local trajectory within an empty cell is S CAN whose resolution (the distance between two successive parallel segments of the trajectory) is r , the length of local trajectory is:2local lLen nl r ⎛=+⎜⎝⎠⎞⎟ (3) Therefore, the length of the complete trajectory is:31comp nl Len n m l r ⎛=+−+⎜⎝⎠⎞⎟ (4) And the lower bound of complete trajectory is: 31lower nl Len n l r ⎛=−+⎜⎝⎠⎞⎟ (5) Table 2 gives the length of complete trajectory (r =5m). If the cell is 50*50m 2, ant colony algorithm provides theshortest trajectory, but greedy strategy provides the shortest trajectory if the cell is 25*25m 2 and 20*20m 2.Moreover, the greedy strategy is faster than ant colonyalgorithm to obtain the global trajectory, so it is the bestmethod among these three methods. Meanwhile, the complete trajectory becomes longer if the cell is smaller,regardless whatever the global trajectory is.V. C ONCLUSIONS AND F UTURE W ORKSThe main contribution of this paper is to give a pathplanning method that can avoid obstacles. Using fixed cell decomposition, the sensor network deployment area are divided into many cells, and represented by a connectivity graph. Three algorithms including depth first search, greedy strategy method and ant colony algorithmare designed to compute the approximate optimal global path among empty cells. The simulation results indicate that smaller cell size leads to more localizable sensor nodes. Unfortunately, it also results in longer complete beacon trajectory. Therefore, how to make a balance between them is worthy of studying in the future works.(a) configuration space (b) cell decompositionFigure 2. Configuration space for simulation and results of celldecomposition(a) connectivity graph (b) depth first search(c) greedy search (d) ant colony algorithmFigure 4. Connectivity graph and global trajectory (25*25m 2)(a) connectivity graph (b) depth first search(c) greedy search (d) ant colony algorithm Figure 3. Connectivity graph and global trajectory (20*20m 2)(a) connectivity graph (b) depth first search(c) greedy search (d) ant colony algorithm Figure 5. Connectivity graph and global trajectory (50*50m 2)Table 1. Number of each kind of cells and localizable nodes Cell size(m)Empty cells Mixed cells Full cellsLocalizable nodes50 69 30 1 19925 314 69 17 232 20 500 92 33 243 Table 2. Length of complete trajectory (unit: m) Cell sizeDFSGreedyACALower bound50 46750 45700 45200 44800 25 63275 62775 63325 62775 20 74680 70480 70820 69980A CKNOWLEDGMENTThis work was supported in part by the National Natural Science Foundation of China under grants60773034 and 60802030; The Natural ScienceFoundation of Shandong Province under grants ZR2009GQ002, ZR2010FQ014; Primitive Research Fund for Excellent Young and Middle-aged Scientists of Shandong Province under grant BS2009DX011. R EFERENCES[1] Y. Liu, Z. Yang, X. Wang and L. Jian, "Location,localization, and localizability," Journal of Computer Science and Technology ,Vol.25,pp.274-297,2010.[2] B. Zhang and F. Yu,"An energy efficient localizationalgorithm for wireless sensor networks using a mobile anchor node,"in Proc. of IEEE Inter. Conf. on Information and Automation ,2008,pp. 215-219.[3] N. B. Priyantha, H. Balakrishnan, E. D. Demaine and S.Teller,"Mobile-assisted localization in wireless sensor networks,"in Proc. of IEEE INFOCOM ,2005,pp. 172-183. [4] M. L. Sichitiu and V. Ramadurai,"Localization of wirelesssensor networks with a mobile beacon,"in Proc. of IEEE Inter. Conf. on Mobile Ad-hoc and Sensor Systems , 2004, pp. 174-183.[5] B. Xiao, H. Chen and S. Zhou,"Distributed localizationusing a moving beacon in wireless sensor networks,"IEEE Transactions on Parallel and Distributed Systems , Vol.19, pp.587-600,2008.[6] S. Lee, E. Kim, C. Kim and K. Kim,"Localization with amobile beacon based on geometric constraints in wireless sensor networks,"IEEE Transactions on Wireless Communications, Vol.8,pp.5801-5905,2009.[7] E. Guerrero, H. G. Xiong, Q. Gao, R. Ricardo and J.Estévez,"ADAL: a distributed range-free localization algorithm based on a mobile beacon for wireless sensor netwoks,"in Proc. of Inter. Conf. on Ultra Modern Telecommunications , 2009,pp. 1-7.[8] K.-F. Ssu, C.-H. Ou and H. C. Jiau,"Localization withmobile anchor points in wireless sensor networks,"IEEE Transactions on Vehicular Technology ,Vol.54,pp.1187-1197,2005.[9] Z. Guo, Y. Guo, F. Hong, Z. Jin, Y. He, Y. Feng, etal.,"Perpendicular intersection: Locating wireless sensors with mobile beacon,"IEEE Transactions on Vehicular Technology ,Vol.59,pp.3501-3509,2010.[10] B. Zhang, F. Yu and Z. Zhang,"A high energy efficientlocalization algorithm for wireless sensor networks using directional antenna,"in Proc. of 11th IEEE Inter. Conf. on High Performance Computing and Communications, 2009,pp. 230-236.[11] Q. Shi and C. He,"Multi-power level mobile beaconassisted distributed node localization algorithm," Journal of Communications ,Vol.30,pp.8-13,2009.[12] G. Teng, K. Zheng and W. Dong,"Adapting mobilebeacon-assisted localization in wireless sensor networks,"Sensors ,Vol.2009,pp.2760-2779,2009.[13] G. Teng, K. Zheng and W. Dong,"An efficient and self-adapting localization in static wireless sensor networks,"Sensors ,Vol.2009,pp.6150-6170,2009.[14] D. Koutsonikolas, S. M. Das and Y. C. Hu,"Path planningof mobile landmarks for localization in wireless sensor networks,"Computer Communications ,Vol.30,pp.2577-2592,2007.[15] J. M. Bahi and A. Makhoul,"A mobile beacon basedapproach for sensor network localization,"in Proc. of 3rd IEEE Inter. Conf. on Wireless and Mobile Computing, Networking and Communications ,2007,pp. 44-48.[16] R. Huang and G. V. Zaruba,"Static path planning formobile beacons to localize sensor networks,"in Proc.of IEEE PerCom ,2007,pp. 323-330. [17] Q. Fu, W. Chen, K. Liu, W. Chen and X. Wang,"Study onmobile beacon trajectory for node localization in wirelesssensor networks,"in Proc. of the IEEE Inter.Conf.on Information and Automation ,2010,pp. 1577-1581. [18] S.-J. Li, C.-F. Xu, Y. Yang and Y.-H. Pan,"Getting mobilebeacon path for sensor localization,"Journal of Software ,Vol.19,pp.455-467,2008.[19]H. Li, Y. Bu, H. Xue, X. Li and H. Ma,"Path planning for mobile anchor node in localization for wireless sensor networks,"Journal of Computer Research and Development , Vol.46,pp.129-136,2009.[20]Y. Wei, R. Li, H. Chen and J. Luo,"Path planning of mobile beacon for localization in wireless sensor network,"Journal of System Simulation ,Vol.21,pp.7258-7261,2009.[21]G. Tan, M. Bertier and A.-M. Kermarrec,"Visibility-graph-based shortest-path geographic routing in sensor networks,"in Proceedings of IEEE INFOCOM ,2009,pp. 1719-1727.[22] F. Lingelbach,"Path planning using probabilistic cell decomposition,"in Proceedings of IEEE Inter.Conf. on Robotics and Automation ,2004,pp. 467-472.[23]M. Dorigo, V. Maniezzo and A. Colorni,"The ant system:Optimization by a colony of cooperating agents,"IEEE Transactions on Systems, Man, and Cybernetics-Part B ,Vol.26,pp.29-41,1996.Huan-qing CUI, born in 1979, received his master degree in computer software and theory from Shandong University of Science and Technology in 2001 and 2004 respectively. He is now a Ph.D candidate.He is a member of ACM and CCF. His research interests include wireless sensornetwork, high performance computation.Ying-long WANG , born in 1965, receivedhis master degree in industrial automation from Shandong University of Technology (Shandong University now) in 1995, and doctor degree in communication and information systems from Shandong University in 2005. He is a fellow in Shandong Academyof Sciences.His research interests include wireless network, information security, and cloud computing etc.Qiang GUO , born in 1975, received his doctor degree of Electronic Science and Technology in Shanghai Jiaotong University in 2006. His research field includes wireless sensor network and wireless communication. He is a member ofIEEE.Nuo WEI , born in 1982, received her master degree in Computer Application Technology from Ocean University of China in 2006.Her research interests include wireless sensornetwork, wireless communication.。
航空航天专业翻译必备词汇
仿真simulation可靠性reliability 火箭rocket直升机helicopter 导航navigation 火箭发动rocket航空发动aeroengine航天space轨道orbit转子rotor飞行员pilots天线antenna数值计算numerical粘性viscous绕流flow燃速rate鲁棒robust空中air射流jet超声速supersonic 仿真研究simulation 热流heat 超音速supersonic固体推进propellant卡尔曼滤kalman挠性flexible 再入reentry可靠性分reliability敏感器 sensor 燃油 fuel飞机结构 aircraft 涡扇发动机turbofan力矩 moment 微重力 microgravity鲁棒性robustness高度 altitude喷流 jet 试飞 flight摄动 perturbation 微型 micro可靠度 reliability 出口 exit光纤陀螺 fog非结构 unstructured 相流flow回路loop系统可靠reliability直升机旋helicopter某型飞机aircraft无人unmanned冲压发动ramjet紊流turbulent 热管heatpid控制pid姿态确定attitude轴流压气compressor超燃冲压scramjet 多学科 multidisciplinary 弹道 trajectory可靠性设reliability 换热器 heat 中文 英文 涡喷turbojet热控 thermal 仿真试验simulation飞行仿真 simulation 残余应力residual空间飞行spacecraft热传导heat不可压缩 incompressible航空电子avionics静压pressure热防护thermal直升机飞helicopter碰撞collision 尾旋spin空气动力aerodynamic 转子系统rotor合成孔径sar可靠性评reliability月球车 rover 引射ejector交会对接 rendezvous 效能评估effectiveness结构可靠reliability爆震波 detonation 补燃combustion比目鱼 soleus 中文 英文 姿态测量attitude多学科设multidisciplinary静止 geostationary 构型 configuration流态 flow 运动病 sickness惯量inertia空间交会 rendezvous成像 imaging效能 effectiveness 鱼雷torpedo军事 military建模 modeling 自适应 adaptive距离 range 装药 charge天线antenna弹丸 projectile合成孔径sar导弹武器missile点火 ignition 回波 radar发射药 propellant 武器装备 weapon装甲 armored 爆炸explosion雷管detonator弹道导弹missile舰船ship攻击attack冲击shock计算机仿真simulation数字仿真simulation 舰炮gun信息融合fusion火药propellant回波信号signal运动目标 moving雷达信号radar半实物仿simulation仿真方法 simulation回路 loop气动力 aerodynamic 靶场 range多普勒雷doppler反辐射 anti-radiation 维修保障maintenance噪比 snr 脱靶miss脉冲多普doppler融合技术 fusion仿真实验 simulation分辨力 resolution 备件 spare鲁棒性 robustness 攻角attack雷达导引seeker某导弹 missile 近炸引信proximity层次分析ahp履带 tracked 延时delay虚警false双基地 bistatic雷达探测 radar 鱼雷武器 torpedo动力学仿simulation部队 army 空战air海杂波 clutter抗干扰能力anti-jamming爆轰波 detonation 雷达干扰jamming作用距离 range精度高precision军事领域 military战术技术 tactical鱼雷武器torpedo超视距雷radar斑点speckle反导anti-missile烟火pyrotechnic指挥系统command雷达散射rcs反隐身 anti-stealth 聚束spotlight引战配合 warhead 外形 shape自适应滤adaptive信号处理processor战略导弹 missile 数字信号处理器 dsp方程 equation 非线性nonlinear关于on微分 differential 条件conditions存在性 existence 稳定性stability数学 mathematics 随机random最优 optimal 周期 periodic 优化optimization不等式inequality周期解periodic空间中space价格price因素factors推广generalized 拓扑topological对称symmetric如果if插值interpolation 预测model定价pricing 成本cost序列sequence 级数series一类非线nonlinear期权option型方程equations样条spline表示representation度量metric随机变量random构造construction 方差variance存在唯一existence单位unit任意arbitrary梯度gradient偏微分方程differential正态normal正规normal情形case猜想conjecture常数constant 范数norm维数dimension 中文英文齐次homogeneous不变invariant分形 fractal渐近稳定stability显式 explicit 二维two-dimensional二阶非线nonlinear银行 bank 动点fixed线性方程equations有效性 method 股市stock准则 criterion 未知unknown破产 ruin特征值问题eigenvalue计算公式 formula 广泛widely 公共common粗糙集 rough费用cost数值计算 numerical存在性定existence非线性方nonlinear推广到generalized数值解 numerical时滞微分delay指数分布 exponential 不可约irreducible非线性微nonlinear可靠性分reliability析新算法algorithm博弈模型game扩散方程diffusion奇摄动perturbed 实数real系统可靠性reliability四元数quaternion多目标规multiobjective模糊综合fuzzy偏好preference函数法function全局收敛convergence偏差 deviation 似然估计 likelihood层次分析ahp稳定性分stability零点 zeros 大系统systems 一致性consistency无界 unbounded评价指标evaluation存在性问existence等式 equality 协方差covariance对角diagonal估计方法 estimation最优性条optimality中立型时neutral整数解integer子流形submanifold代数方程algebraic一点注记note收益率return逼近问题approximation丢番图方diophantine关联grey流动性liquidity压缩contraction 股票价格stock微积分calculus破产概率ruin非线性中neutral对称矩阵symmetric 增生accretive决策方法decision 可数countable模型为model非齐次nonhomogeneous可测measurable非线性发展方程nonlinear自同构群automorphism 幂级数series解集solution鞍点 saddle二次型 quadratic 求法method非线性算nonlinear指数稳定stability对应 corresponding bayes 估计 b ayes节点 nodes 分岔 bifurcation区间数 interval 二项 binomial数学规划 programming 数学课程 mathematicsweibull分weibull边际 marginal 宏观经济 macroeconomic置换 permutation 次微分 differential证券组合 portfolio 分解定理 decomposition外商直接fdi区间上interval一个问题 problemhamiltonhamiltonian系统稳定stability直径 diameter 间接 indirectlyapunovlyapunov布朗运动 brownian 一致收敛convergencehausdorffhausdorff拉格朗日 lagrange 算法求解 algorithm代数方程equations马尔可夫markov极大极小 minimax 通用 general独立性independence小波分析wavelet可转换 convertible 非协调nonconforming有解 solution 估计量estimator四边形 quadrilateral唯一性问题uniqueness线性化linearization 统计学statistics次数number包络envelopment 脉冲微分impulsive矩形板rectangular 不稳定性instability外推extrapolation 非奇异nonsingular逆问题inverse 函数类functions启发式算heuristic变元arguments 直和direct不变量invariant 定积分integral稳定性理stability 三次样条spline约束条件constraints等价关系equivalence 无穷维infinite有向图digraph。
基于卡尔曼滤波的动态轨迹预测算法
基于卡尔曼滤波的动态轨迹预测算法乔少杰;韩楠;朱新文;舒红平;郑皎凌;元昌安【摘要】基于拟合的传统轨迹预测算法已无法满足高精度和实时性预测要求.提出基于卡尔曼滤波的动态轨迹预测算法,对移动对象动态行为进行状态估计,利用前一时刻的估计值和当前时刻的观测值更新对状态变量的估计,进而对下一时刻的轨迹位置预测.大量真实移动对象数据集上的实验结果表明:GeoLife数据集上基于卡尔曼滤波的轨迹预测算法的平均预测误差(预测轨迹点与实际轨迹点的均方根误差)为12.5米;与基于轨迹拟合的轨迹预测算法相比,T-Drive数据集预测误差平均下降了555.4米,预测准确率提升了7.1%.在保证预测时效性前提下,基于卡尔曼滤波的动态轨迹预测算法解决了轨迹预测精度较低的问题.%Traditional fitting-based trajectory prediction algorithms cannot meet the requirements of high accuracy and real-time prediction.A dynamic Kalman filter based TP approach was proposed,which performs state estimation of dynamic behavior with regard to moving objects,updates the state variable estimation value based on the estimation of the previous and current observation states,in order to infer the next location of moving objects.Extensive experiments are conducted on real datasets of moving objects and the results demonstrate that the average prediction error(root mean square error between the predicted location and the actual location) of the TP algorithm based on Kalman filter is around 12.5 meters on the Ge-oLife datasets.The prediction error is reduced by about 555.4 meters by compared to the fitting-based TP algorithms,and the prediction accuracy is increased by 7.1% on the T-Drive datasets as well.The dynamic TPapproach based on Kalman filter can handle the problem of low prediction accuracy with the guarantee of efficient time performance.【期刊名称】《电子学报》【年(卷),期】2018(046)002【总页数】6页(P418-423)【关键词】移动对象数据库;状态估计;轨迹预测;卡尔曼滤波;轨迹拟合【作者】乔少杰;韩楠;朱新文;舒红平;郑皎凌;元昌安【作者单位】成都信息工程大学网络空间安全学院,四川成都610225;成都信息工程大学管理学院,四川成都610103;西南交通大学信息科学与技术学院,四川成都611756;成都信息工程大学软件工程学院,四川成都610225;成都信息工程大学软件工程学院,四川成都610225;广西师范学院计算机与信息工程学院,广西南宁541004【正文语种】中文【中图分类】TP3111 引言在移动对象轨迹预测高精度要求的应用领域中,基于轨迹拟合的传统预测算法已无法精准地预测出运动行为动态变化的移动对象的轨迹位置[1],将卡尔曼滤波算法[2]应用于移动对象动态轨迹预测的优势主要体现在如下两个方面:(1) 卡尔曼滤波算法尤其适用于运动状态频繁变化、具有不确定性和不同运动模式的轨迹数据,能够对系统状态进行最优估计,能够实现实时运行状态的估计和预测,且适用于有限维度线性和非线性的时空轨迹.(2) 动态轨迹预测对预测结果的实时性和准确度具有非常高的要求,预测偏差过大或者预测位置点的不精确会导致预测失效.将卡尔曼滤波算法应用于轨迹预测具有实时性高的优势,对频繁变换运动状态的移动对象具有较高的自适应性,是一种普适的机器学习方法.2 相关工作当前国内外针对移动对象的轨迹预测的研究,已经取得了系列的研究成果.在挖掘频繁轨迹模式方面,Ying等人[3]通过挖掘同类用户的群体行为模式并结合轨迹的语义特征来预测未来位置信息.Qiao等人[4]通过构建轨迹频繁模式树挖掘频繁轨迹模式.Gambs[5]提出高阶马尔可夫模型用于预测移动对象位置,预测精度可以达到95%以上,但是计算开销比较大.Qiao等人[6]将隐马尔科夫模型HMM应用于移动对象轨迹预测,但没有考虑大数据环境下算法的运行时间性能问题.大多数轨迹预测方法基于轨迹的地理特性,而 Zheng等人[7]对个体的旅行经历和兴趣爱好等语义信息建模预测个体感兴趣的位置点.Qiao等人[8]利用高斯混合模型对移动对象的复杂运动行为模式建模,计算不同运动模式的概率分布情况.Song 等人[9]通过计算轨迹的信息熵证明人类动态运动行为具有93%的可预测性.Pan等人[10]提出了基于多变元正态分布的最佳线性预测器,不足在于预测结果往往会产生延迟.Zhou等人[11]通过动态选择参考轨迹,并基于少量的参数构建精准的预测模型.3 基于卡尔曼滤波的动态轨迹预测算法3.1 基本概念及问题描述已知移动对象的轨迹数据集T,存储大量运动对象在不同时刻下的位置点信息,根据时间上的有序形式组成的位置点集合称为轨迹Trj,n条轨迹组成的轨迹数据集用T={Trj1,Trj2,…,Trjn}表示.定义1(轨迹矢量集) 对欧式空间二维平面x轴和y轴方向进行建模,利用两个方向上的矢量表示轨迹数据:其中,表示第 i 条轨迹在x方向上的投影矢量集,表示第i条轨迹在y方向上的投影矢量集,称为轨迹 Trji 的矢量集,T称为轨迹矢量集.定义2 (卡尔曼滤波) 一种利用线性系统状态方程以及观测方程:X(k+1)=A(k)X(k)+T(k)W(k),Z(k)=H(k)X(k)+V(k),通过以最小均方差为准则,根据滤波方程滤波出最优状态估计值,如下所示:X(k+1,k+1)=X(k+1,k)+K(k+1)[Z(k+1)-Z(k+1,k)]其中,X(k+1)表示k+1时刻下的状态值,A(k)为状态转移矩阵,T(k)为干扰转移矩阵,W(k)表示运动模型的系统状态噪声,Z(k)表示观测向量,H(k)为观测矩阵,V(k)为观测噪声,表示k+1时刻下最优状态估计值,K(k+1)为k+1时刻的增益矩阵.定义3 (预测误差) 对于预测轨迹点与实际轨迹点的几何空间误差采用公式(1)所示的均方根误差RMSE来计算:(1)其中,(xi,yi)表示实际轨迹点的位置,(x i′,yi′)表示预测轨迹点的位置信息,k表示预测轨迹点的数量.定义4(预测命中) 当轨迹预测完成时,根据均方根误差RMSE与给定的阈值的大小关系确定轨迹预测结果是否准确,当均方根误差RMSE值小于阈值则属于命中;否则,属于没有命中.3.2 算法工作原理卡尔曼滤波(Kalman Filtering)[2]通过系统输入输出观测数据对系统状态进行最优估计,尤其适用于运动状态频繁变化运动行为的预测,能够实现实时预测.卡尔曼滤波动态轨迹预测系统的状态方程(公式2)和观测方程(公式3),如下所示:X(k+1)=A(k)X(k)+T(k)W(k)(2)Z(k)=H(k)X(k)+V(k)(3)其中,X(k)表示系统状态向量,描述了在k时刻下运动对象状态矢量;A(k)表示状态转移矩阵,用于描述由前一时刻到当前时刻下的运动状态转移方式;T(k)为干扰转移矩阵;W(k)表示运动模型的系统状态噪声,其统计特性与白噪声或高斯噪声相似;Z(k)表示观测向量,描述了k时刻的观测值;H(k)为观测矩阵,对于单测量系统,H(k)为1×1维的矩阵;V(k)为运动估计过程中产生的观测噪声.假设系统噪声W(k)与观测噪声V(k)是相互独立的高斯白噪声,其协方差分别是Q 和R,其统计特性如下所示:E[W(k)V(k)T]=0卡尔曼滤波算法核心是运用递归算法来达到最优状态估计的估计模型,利用前一时刻的估计值和现时刻的观测值来更新当前状态变量的估计,基于前 k个观测值得出k时刻下的最优状态估计x′(k),计算最小方差计算的策略如公式(4)所示:(4)在随机线性离散卡尔曼滤波周期过程中存在两个不同更新过程,分别是时间更新过程和观测更新过程,时间更新过程根据前一时刻最优状态估计预测出当前时刻下的状态,同时更新当前预测状态的协方差P(k+1, k),时间更新方程如公式(5)~(6)所示.X(k+1,k)=A(k)X(k,k)(5)Z(k+1,k)=H(k)X(k+1,k)(6)当预测出轨迹点之后,需要利用观测值进行线性拟合出最优估计轨迹点位置,即根据观测值和预测值通过观测更新方程来推测出最优估计点,观测更新方程表达式如下面公式(7)和公式(8)所示.B(k+1)=Z(k+1)-Z(k+1,k)(7)X(k+1,k+1)=X(k+1,k)+K(k+1)B(k+1)(8)以上方程中除了滤波增益矩阵K未知,其他的参数均是已知的,所以接下来讨论增益矩阵K.增益矩阵K是基于状态噪声协方差以及观测噪声协方差得出的,如公式(9)~(11)所示;同时给出下一时刻最优状态估计协方差更新公式如公式(12)所示. P(k+1,k)=A(k)P(k,k)A(k)T+T(k)Q(k)T(k)T(9)S(k+1)=H(k+1)P(k+1,k)H(k+1)T+R(k+1)(10)K(k+1)=P(k+1,k)H(k+1)TS(k+1)-1(11)P(k+1,k+1)=P(k+1,k)-K(k+1)S(k+1)K(k+1)T(12)其中,Q(k)表示系统噪声W(k)的对称非负定方差矩阵,R(k)是观测噪声,V(k)的对称正定方差矩阵,P(k,k)为误差方差阵,P(k+1,k)为预测状态X(k+1,k)误差方差阵,K(k)为滤波增益矩阵.预测过程中,首先根据上面滤波过程得到的初始状态估计值以及协方差阵以及公式(13),得到增益矩阵K,如下所示.K(k)=A(k)P(k,k-1)HT(k)[H(k)·P(k,k-1)HT(k)-R(k)]-1(13)得到增益矩阵K之后,根据最优预测估计方程公式(14),得到下一时刻预测值X(k+1,k),同时更新估计误差方差阵P(k+1,k),如下所示.X(k+1,k)=A(k)X(k,k-1)+K(k)[Z(k)-H(k)X(k,k-1)](14)P(k+1,k)=A(k)P(k,k-1)AT(k)-A(k)P(k,k-1)·HT(k)*[H(k)P(k,k-1)*HT(k)+R(k)]-1H(k)P(k,k-1)AT(k)+T(k)Q(k)TT(k)(15)根据上面的公式得到下一时刻的最优预测值,完成单步预测过程.如果预测n 步时,则可以迭代预测n 次,即可完成 n 步预测.3.3 轨迹预测算法描述基于卡尔曼滤波的轨迹预测算法如算法1所示.详细步骤为:算法1 基于卡尔曼滤波的轨迹预测算法输入:移动对象的轨迹数据集T={Trj1,Trj2,…,Trjn}.输出:轨迹预测误差均值RMSE.1. D=trajectPretreatment(T);2. initParameters();3. state=getCurrentState(D);4. for i=1 to k5. p’=kalmanPredict(D);6. e[i]=getRMSE(p,p’);7. end for9. Output RMSE;(1) 分析移动对象的轨迹数据集,对数据进行修正、筛选以及xy坐标转换完成预处理操作(第1行);(2) 根据系统的状态方程和观测方程确定的运动模型参数,并初始化A、Q、R等参数(第2行).(3) 已知初始时刻(即i=0时刻)下的最优状态估计值X(0,0)以及估计误差方差阵P(0,0),便可以根据系统状态方程预测出下一时刻(即 i=1时刻)移动对象预测值X(1,0),同时得到估计误差的协方差阵P(1,0);然后,根据 i=1时刻下的观测值Z(1)得到i=1时刻下的最优状态估计值X(1,1),以及最优估计误差的协方差阵P(1,1),完成一步滤波;依次迭代得到前一时刻的最优状态估计X(n-1,n-1),完成滤波过程(第3行).(4) 根据前面得到的前一时刻的最优状态估计X(n-1,n-1),以及当前时刻的观测值预测出第n+1时刻下的轨迹点位置(第5行),预测点p’与真实轨迹点p进行比较,计算出预测误差(第6行);依次重复k次操作完成未来k步轨迹点的预测,最后计算并输出预测误差均值(第8~9行).4 实验分析4.1 数据集描述实验采用经典移动对象轨迹数据集:GeoLife数据集[12]以及出租车轨迹数据集T-Drive[13].实验中硬件环境:主频为2.4GHz的Intel Core I3 CPU上,内存为4GB,操作系统为Windows 7,集成开发环境为:Eclipse+JDK1.6.实验参数设置如表1所示.表1 参数设置参数值移动对象轨迹数据集GeoLife,T⁃Drive移动对象轨迹总数17621,10355测试轨迹数量1000,2000,3000,4000,…,10000历史轨迹输入长度10,20,30,40,50预测轨迹长度(步数)1,2,3,4,5预测误差阈值25m观测噪声协方差矩阵R[10,0;0,10][1,0,0,0;0,1,0,0;0,0,1,0;0,0,0,1]系统噪声协方差矩阵Q[10,0,0,0;0,10,0,0;0,0,10,0;0,0,0,10][100,0,0,0;0,100,0,0;0,0,100,0;0,0,0,100]实验对比算法包括:基于卡尔曼滤波的动态轨迹预测算法,朴素卡尔曼滤波预测算法,文献[8]提出的基于隐马尔可夫模型的轨迹预测算法,基于轨迹拟合的N点线性逼近算法,N点二次多项式平方预测算法.朴素卡尔曼滤波与基于卡尔曼滤波的预测算法在预测过程不同,朴素算法直接通过状态方程X(k+1)=A(k)X(k)进行预测,而基于卡尔曼滤波算法:利用观测值重新计算增益,从而预测下一步,依次利用前一时刻的观测迭代k步,完成k步预测.基于隐马尔可夫模型的轨迹预测算法构建移动对象运动状态转换的隐马尔可夫链,根据当前状态预测下一位置状态.最后两种预测算法通过选取距离预测值较近的N点测量值来预测目标,所以预测步长选取范围很大程度上影响着预测效果.本文中对于基于轨迹拟合的轨迹预测算法选取的步长为5步.4.2 预测准确性和时间性能分析本节对4种算法在不同测试集规模在1000~10000条下进行对比实验,采用定义3预测误差进行评价,实验结果取每种测试集下所有轨迹预测误差RMSE及准确率的平均值评价预测准确性.第一组实验:GeoLife数据集规模较大,为了保证消除特定训练数据和测试数据对实验结果的影响,本文随机选取1000~10000条轨迹数据,分别对4种算法进行训练和预测.从预测误差、预测准确率和预测时间上证明所提算法的优势,结果如图1~图3所示.GeoLife数据集上实验结果表明:(1) 如图1~图2所示,对于预测准确性分析得到:与另外两种基于轨迹拟合的预测算法相比,基于卡尔曼滤波的轨迹预测算法的误差最小,算法的预测误差平均为12.5m,准确性在88%上下波动.原因在于基于卡尔曼滤波的轨迹预测算法对于运动行为相对稳定的移动对象,只需经过一段短暂的滤波初期阶段之后,预测效果较好,并且误差比较小.基于隐马尔可夫模型预测算法的预测误差略高于基于卡尔曼滤波的轨迹预测算法,预测准确率略低于基于卡尔曼滤波的轨迹预测算法,且这两项指标上均优于N点线性逼近算法和N点二次多项式平方预测算法.原因在于对于速度任意变化的移动对象,其运动状态具有不确定性,而马尔可夫模型本质是概率统计模型,导致其预测偏差高于且预测准确性低于不受运动状态影响的基于卡尔曼滤波的轨迹预测算法.(2) 对于运行时间分析,如图3所示,朴素卡尔曼滤波预测算法与基于卡尔曼滤波的轨迹预测算法的时间代价均很大,因为基于卡尔曼滤波的轨迹预测算法需要对训练轨迹数据的多次迭代得出当前时刻的最优状态估计,而基于轨迹拟合的预测算法只是需要根据前5步训练轨迹数据得出目标运动规则.从图3中可以发现:随着测试轨迹数递增,基于卡尔曼滤波的轨迹预测算法的时间代价递增减缓,进而证明了本文所提方法具有可伸缩性和稳定性.此外,相比于其他四种预测算法,基于隐马尔可夫模型预测算法的预测时间最长.原因在于其需要构建移动对象隐状态之间的概率转换矩阵及隐状态到观测状态之间的概率转换矩阵,这两个操作非常耗时.第二组实验:为了保证不让某些时间间隔较长的轨迹数据集影响算法的预测精度,本文将T-Drive数据集中时间序列超过 5秒的轨迹数据集去除.实验中随机选取1000-10000条轨迹数据,结果如图4~图6所示.通过分析T-Drive数据集上的实验结果得到如下结论:(1) 对于预测准确性分析,如图4~图5所示,由于汽车机动性较强,导致T-Drive数据集里轨迹点波动较大,进而预测误差非常大.与N点线性逼近算法和N点二次多项式平方预测算法相比,基于卡尔曼滤波的预测算法的预测误差最小,预测误差平均下降了555.4米,预测准确率提升了7.1%.基于隐马尔可夫模型的预测算法在速度随机变化的轨迹数据上预测效果不佳,本节实验也说明了这一点,其预测偏差略高于且预测准确性略低于基于卡尔曼滤波的预测算法.(2) 对于运行时间分析,如图6所示,与GeoLife数据集得出的结论一致,这里不再赘述.5 结论及未来工作本文利用卡尔曼滤波模型对轨迹位置点进行连续预测,通过采用系统的状态空间模型以及观测模型,以最小均方差为准则估计动态系统的状态,进而实现准确和高效的位置预测.所提模型的优势在于预测对象过程中具有无偏、稳定和最优的特性.移动对象轨迹预测的研究仍然存在如下问题有待进一步研究,如:对移动对象的未来长时间轨迹位置的预测,保证预测的实时性及预测算法充分考虑影响对象运动行为的主客观因素等研究.参考文献【相关文献】[1]Meng X,Ding Z,Xu J.Moving Objects Management:Models,Techniques and Applications[M].Springer Press,2014.105-112.[2]Kalman R E.A new approach to liner filtering and prediction problems[J].Journal of Basic Engineering,1960,82D(1):35-45.[3]Ying J J,Lee W,Weng T,Tseng V S.Semantic trajectory mining for locationprediction[A].Proceedings of the 19th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems[C].New York:ACM,2011.34-43.[4]Qiao S,Han N,Zhu W,Gutierrez L A.TraPlan: an effective three-in-one trajectory prediction model in transportation networks[J].IEEE Transactions on Intelligent Transportation Systems,2015,16(3):1188-1198.[5]Gambs S,Killijian M,Cortez D P,Miguel N.Next place prediction using mobility Markov chains[A].Proceedings of the 1st Workshop on Measurement,Privacy,and Mobility[C].New York:ACM,2012.3:1-6.[6]Qiao S,Shen D,Wang X,Han N,Zhu W.A self-adaptive parameter selection trajectory prediction approach via hidden Markov models[J].IEEE Transactions on Intelligent Transportation Systems,2015,16(1):284-296.[7]Zheng Y,Zhang L,Xie X,Ma W.Mining interesting locations and travel sequences from GPS trajectories[A].Proceedings of the 18th International Conference on World WideWeb[C].New York:ACM,2009.791-800.[8]乔少杰,金琨,韩楠,唐常杰,格桑多吉,Gutierrez Louis Alberto.一种基于高斯混合模型的轨迹预测算法[J].软件学报,2015,26(5):1048-1063.Qiao S,Jin K,Han N,Tang C,Gesangduoji,Gutierrez L A.Trajectory prediction algorithm based on Gaussian mixture model[J].Journal of Software,2015,26(5):1048-1063.(in Chinese) [9]Song C,Qu Z,Blumm N,Barabsi A.-L.Limits of predictability in humanmobility[J].Science,2010,327(5968):1018-1021.[10]Pan T,Sumalee A,Zhong R,Indra-payoong N.Short-term traffic state prediction based on temporal-spatial correlation[J].IEEE Transactions on Intelligent Transportation Systems,2013,14(3):1242-1254.[11]Zhou J,Tung K H,Wu W,Ng W S.A “semi-lazy” approach to probabilistic path prediction in dynamic environments[A].Proceedings of the 19th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining[C].NewYork:ACM,2013.748-756.[12]Zheng Y,Xie X,Ma W.Geolife: A collaborative social networking service among user,location and trajectory[J].IEEE Data Engineering Bulletin,2010,33(2):32-40.[13]Yuan J,Zheng Y,Xie X,Sun G.T-Drive: enhancing driving directions with taxi drivers’ intelligence[J].IEEE Transactions on Knowledge and Data Engineering,2013,25(1):220-232.。
基于车辆轨迹的高速公路异常事件自动检测算法
基于车辆轨迹的高速公路异常事件自动检测算法*李斌1马静1徐学才2▲马昌喜3(1.兰州朗青交通科技有限公司兰州730030;2.华中科技大学土木与水利工程学院武汉430074;3.兰州交通大学交通运输学院兰州730070)摘要:高速公路异常事件自动检测是有效保障道路交通安全和运输效率的重要手段,由于监控视频数据量巨大,现有自动检测算法存在实时性、准确性低的问题。
为此本文提出了基于轨迹分类的对比性悲观似然(comparative pessimistic likelihood estimation,CPLE)算法。
构建了包含车辆检测、车辆跟踪和轨迹分类3种功能的异常事件自动检测模型框架,采用YOLO v3对车辆进行目标检测,获得4类不同车辆类型的相关信息,采用简单在线和实时跟踪算法对车辆进行多目标跟踪,获得不同场景的异常事件车辆轨迹;基于半监督学习,采用极大似然法对车辆轨迹分类进行改进,引入对比性悲观似然估计,围绕其对比和悲观原则进行参数设置和标定,进行异常事件轨迹分类和确认,提出基于车辆轨迹的异常事件自动检测算法。
以甘肃省G312线公路智能化检测系统为测试对象,共收集1300段视频,形成530条测试集轨迹和630条验证集轨迹,测试结果表明:通过对不同场景异常事件进行检测和预警,基于对比性悲观似然估计的轨迹分类算法性能准确率达到89.7%,比自学习和监督学习方法的准确率分别高出23.6%和41.3%,尽管对散落货物和超速事件的检测正确性稍低,平均为77.0%,但突发性停车、拥堵和事故的检测平均正确率达98.2%,在严重影响交通的事件检测方面的平均正确率达到94%。
本方法丰富了高速公路异常事件自动检测算法,可作为异常事件自动检测提供备选方法。
关键词:交通安全;高速公路;车辆轨迹;YOLO v3;SORT;对比性悲观似然估计中图分类号:U491.5文献标识码:A doi:10.3963/j.jssn.1674-4861.2023.03.003An Automatic Freeway Incident Detection Algorithm using VehicleTrajectoriesLI Bin1MA Jing1XU Xuecai2▲MA Changxi3(nzhou LongKing Transportation Science&Technology Co.Ltd.,Lanzhou730030,China;2.School of Civil and Hydraulic Engineering,Huazhong University of Science and Technology,Wuhan430074,China;3.School of Traffic and Transportation Engineering,Lanzhou Jiaotong University,Lanzhou730070,China) Abstract:An automatic freeway incident detection method is important for maintaining a safe,efficient traffic op-eration.Due to the fact that a large number of surveillance videos may hinder the real-time and accurate response of current automatic incident detection algorithms,a comparative pessimistic likelihood estimation(CPLE)algorithm based on trajectory classification is proposed.A framework for automatic detection of anomalous events,which con-tains vehicle detection,vehicle tracking and trajectory classification,is developed.YOLO v3is employed to detect the vehicles,and related information about four different types of vehicles is obtained.Online real-time tracking al-gorithms are used for multi-target tracking of vehicles.Anomalous event vehicle trajectories are obtained for differ-ent scenarios.Based on semi-supervised learning,the maximum likelihood method is employed to improve the clas-sification of vehicle trajectories.CPLE is introduced and parameter setting and labeling are centered on comparison and pessimistic rules in order to classify and determine the incident trajectories,consequently,the automatic inci-收稿日期:2021-10-20*国家自然科学基金项目(52062027、72131008)、甘肃省科技重大专项计划项目(22ZD6GA010)资助第一作者简介:李斌(1982—),本科,高级工程师.研究方向:交通新基建、智能交通.E-mail:***************▲通信作者:徐学才(1979—),博士,副研究员.研究方向:智能交通系统、机器学习.E-mail:******************.cn0引言高速公路安全化、信息化和智能化是保障交通安全、畅通和可持续发展的重要手段。
3D Trajectory Recovery for Tracking Multiple Objects and Trajectory Guided Recognition of A
BU CS TR98-019rev.2.To appear in Proc.IEEE Conf.on Computer Vision and Pattern Recognition,June19993D Trajectory Recovery for Tracking Multiple Objectsand Trajectory Guided Recognition of ActionsR´o mer Rosales and Stan SclaroffComputer Science Department,Boston UniversityAbstractA mechanism is proposed that integrates low-level(im-age processing),mid-level(recursive3D trajectory estima-tion),and high-level(action recognition)processes.It isassumed that the system observes multiple moving objectsvia a single,uncalibrated video camera.A novel extendedKalmanfilter formulation is used in estimating the rela-tive3D motion trajectories up to a scale factor.The re-cursive estimation process provides a prediction and errormeasure that is exploited in higher-level stages of actionrecognition.Conversely,higher-level mechanisms providefeedback that allows the system to reliably segment andmaintain the tracking of moving objects before,during,andafter occlusion.The3D trajectory,occlusion,and seg-mentation information are utlized in extracting stabilizedviews of the moving object.Trajectory-guided recognition(TGR)is proposed as a new and efficient method for adap-tive classification of action.The TGR approach is demon-strated using“motion history images”that are then recog-nized via a mixture of Gaussian classifier.The system wastested in recognizing various dynamic human outdoor ac-tivities;e.g.,running,walking,roller blading,and cycling.Experiments with synthetic data sets are used to evaluatestability of the trajectory estimator with respect to noise.1IntroductionTracking non-rigid objects and classifying their motion is achallenging problem.The importance of tracking and mo-tion recognition problems is evidenced by the increasingattention they have received in recent years[26].Effectivesolutions to these problems would lead to breakthroughs inareas such as video surveillance,motion analysis,virtualreality interfaces,robot navigation and recognition.Low-level image processing methods have been shownto work surprisingly well in restricted domains despite thelack of high-level models[9,8,30].Unfortunately,mostof these techniques assume a simplified version of the gen-eral problem;e.g.,there is only one moving object,ob-jects do not occlude each other,or objects appear at a lim-ited range of scales and orientations.While higher-level,model-based techniques can address some of these prob-lems[6,12,15,16,18,21,23],such methods typicallyrequire careful placement of the initial model.These limitations arise because object tracking,3D tra-jectory estimation,and action recognition are treated asseparable problems.In fact,these problems are inexorablyintertwined.For instance,an object needs to be tracked ifits3D trajectory is to be recovered;while at the same time,ing tracking to a plane,if the projective effect is avoidedthrough the use of a top,distant view[14].It is also pos-sible to use some heuristics about body part relations and motion on image plane like[13].In our work,we do not as-sume planar motion or detailed knowledge about the objectand our formulation can handle some changes in shape.More complicated representations like[16,12,18,23,15,21],use model-based techniques,generally articulatedmodels comprised of2D or3D solid primitive,sometimes accounting for self-occlusion by having an explicit object model.Shape models were used by[2]for human tracking.The most relevant motion recognition approaches re-lated to our work are those that employ view-based mod-els[3,9,19].In particular,[9]uses motion history im-ages(MHI)and motion energy images(MEI),temporal templates that are matched using a nearest neighbor ap-proach against examples of given motions already learned. The main problem of this method is the requirement of having stationary objects,and the insufficiency of the rep-resentation to discriminate among similar motions.Mo-tion analysis techniques have had the problem that registra-tion of useful,filtered information is a hard labor by itself [9,4,19].Our system provides a functional front-end that supports such tasks.3Basic ApproachA diagram of our approach is illustrated in Fig.1.Thefirst stage of the algorithm is based on the background subtrac-tion methods of[30].The system is initialized by acquiring statistical measurements of the empty scene over a number of video frames.The statistics acquired are the mean and covariance of image pixels in3D color space.The idea is to have a confidence map to guide segmentation of the foreground from the background.Once initialized,moving objects in the scene are seg-mented using a log-likelihood measure between the incom-ing frames and the current background model.The input video stream is low-passfiltered to reduce noise effects.A connected components analysis is then applied to the resulting image.Initial segmentation is usually noisy,so morphological operations and sizefilters are applied.If there are occlusions,or strong similarities between the empty scene model and the objects,then it is possible that regions belonging to the same object may be classi-fied as part of different objects or vice versa.To solve this problem,two sources of information are used:temporal analysis and trajectory prediction.In temporal analysis,a map of the previous segmented and processed frame is kept.This map is used as a possible approximation of the current connected elements.Connec-tivity in the current frame is compared with it,and regions are merged if they were part of the same object in previous frames.This can account for some shadow effects,local background foreground similarities and brief occlusions.In trajectory prediction,an Extended Kalman Filter (EKF)provides an estimate of each object's image bound-ing box position and velocity.The input to the EKF is a2D bounding box that encloses the moving object in the image. The extended Kalmanfilter then estimates the relative3D motion trajectories for each object,based on a3D linear trajectory model.In contrast to trajectory prediction basedLow−LevelReasoningMotionRecognitionFigure1:System Diagram.on a2D model,the3D approach is explicitly designed to handle nonlinear effects of perspective projection.Occlusion prediction is performed based on the current EKF estimates.Given that we know object position and the occupancy map,we can detect occlusions or collisions in the image plane.Our EKF formulation estimates the tra-jectory parameters for these objects assuming locally lin-ear3D motion,also the bounding box parameters are esti-mated.During an occlusion,the EKF can be used to give the maximum likelihood estimate of the current region cov-ered by the object,along with its velocity and position.For each frame,the estimated bounding box is used to resize and resample the moving blob into a canonical view that can be used as input to motion recognition modules. This yields a stabilized of the moving object throughout the tracking sequence,despite changes in scale and position.The resulting translation/scale stabilized images of the object are then fed to an action recognition module.Ac-tions are represented in terms of motion energy images (MEI's)and motion history images(MHI's)[4,9].An MEI is a cumulative motion image,and an MHI is a function of the recency of the motion at every pixel.By using stabi-lized input sequences,it is possible to make the MEI/MHI approach invariant to unrestricted3D translational motion. The stabilized representation is then fed to a moment-based action classifier.The action recognition module employs a mixture of Gaussian classifier,which is learned via the Ex-pectation Maximization(EM).In theory it is necessary to learn representations of every action for all possible trajectory directions.However,the complexity of such an exhaustive approach would be im-practical.We therefore propose a formulation that avoids this complexity without decreasing recognition accuracy. The problem is made tractable via trajectory-guided recog-nition(TGR),and is a direct consequence of our tracking and3D trajectory estimation mechanisms.In TGR,we partition the hemisphere of possible trajectory directions based on the trajectories estimated in the training data. Each partition corresponds to a group of similar trajectory directions.During training and classification,trajectory di-rection information obtained via the EKF is used to deter-mine the direction-partitioned feature space.This allowsautomatic learning and adaptation of the direction space tothose directions that are commonly observed.43D Trajectory from2D Image MotionOur method requires moving blob segmentation and con-nected components analysis as input to the tracking mod-ule.Due to space limitations,readers are to[24]for details of these modules.To reduce the complexity of the trackingproblem,two feature points are selected:two opposite cor-ners of the blob's bounding ing a blob's bounding box alleviates need to searching for corresponding point features in consecutive frames.In general we think that a detailed tracking of features is neither necessary nor easily tenable for non-rigid motion tracking at low resolution.It is assumed that although the object to be trackedis highly non-rigid,the3D size of the object's boundingbox will remain approximately the same,or at least vary smoothly.This assumption might be too strong in some cases;e.g.,if the internal motion of the object's parts can-not be roughly self contained in a bounding box.However, when analyzing basic human locomotion,we believe that these assumptions are a fair approximation.For our representation a3D central projection modelsimilar to[28,1]is used:is the inverse focal length.The origin of the coordinate system isfixed at the image plane. The model is numerically well defined even in the case of orthographic projection.Our state models a3D planar rectangular bounding box moving along a linear trajectory at constant velocity.Be-cause we are considering the objects as being planar,the depth at both feature points should be the same.The re-duction in the number of degrees of freedom improves the speed of convergence of the EKF and the robustness of the estimates.Our state vector then becomes:(2) where,are the corners of the 3D planar bounding box.The vector represents a corner's3D velocity relative to the camera.The sensitivity in and is directly dependent on theobject depth as objects that are farther away from the cam-era tend to project to fewer image pixels.The sensitivity of is an inverse function of camera focal length,becoming zero in the orthographic case.The3D trajectory and velocity are recovered up to ascale factor.However,the family of allowable solutions allproject to a unique solution on the image plane.We can therefore estimate objects'future positions on the image plane given their motion in space.The use of this3D trajectory model offers significantly improved ro-bustness over methods that employ a2D image trajectory model.Due to perspective foreshortening effects,trajecto-ries in the image plane are nonlinear,and2D models are therefore inaccurate.4.1Extended Kalman Filter Formulation Trajectory estimates are obtained via an extended Kalman Filter(EKF)formulation.Our state is guided by the fol-lowing linear equation:(3) where is our state at time,is the process noise and,the system evolution matrix,is based onfirst or-der Newtonian dynamics in3D space and assumed time invariant.If additional prior information on dynamics is available,then can be changed to better de-scribe the system evolution[22].Our measurement vector is, where are the image plane coordinates for the ob-served feature at time.The measurement vector is related to the state vector via the measurement equation:.Note that is non-linear.The EKF time update equation becomes:(4)(5) where is the process noise covariance.The measurement relationship to the process is nonlin-ear.At each step,the EKF linearizes around our current es-timate using the measurement and state partial derivatives. The measurement update equations become:(6)(7)(8)where is the Jacobian of with respect to:(9)where.Finally,the matrix is the Jacobian of with respect to,and is the measurement noise covariance at time.The general assumptions are:and are Gaussian random vectors with, and.For more detail,see[27, 29].Obviously,as more measurements are collected,the er-ror covariance of our estimates tends to decrease.Ex-perimentally40frames were needed for convergence with real data.As will be seen in our experiments,motions that are not linear in3D can also be tracked,but the estimate at the locations of sudden change in velocity or direction is more prone to instantaneous error.The speed of conver-gence when a change in trajectory occurs depends on the filter's expected noise.A reseting mechanism is used to detect when the EKF does not represent the true observa-tions.This is done by comparing the current projection of the estimate with the observation.5Motion RecognitionOur tracking approach allows the construction of an object centered representation.The resulting translation/scale sta-bilized images of the object are then fed to an action recog-nition module.Actions are represented in terms of motion energy images(MEI's)and motion history images(MHI's) [4,9].An MEI is a cumulative motion image,and an MHI is a function of the recency of the motion at every pixel. By using stabilized input sequences,it is possible to make the MEI/MHI approach invariant to unrestricted3D trans-lational motion.The seven Hu moment invariants are then computed for both the MHI and MEI[4,9].The resulting features are combined in a14-dimensional vector.The dimension of this vector is reduced via principal components analysis (PCA)[11].In our experiments,the PCA allowed a dimen-sionality reduction of64%(dim=5),while capturing90% of the variance of our training data.The reduced feature vector is then fed into a maximum likelihood classifier that is based on a mixture of Gaussians model.In the mixture model,each action class is represented by a set of mixture model parameters,.The model pa-rameters and prior distribution,for each action class are estimated during a training phase using the expec-tation maximization(EM)algorithm[10].Given, we calculate using Bayes rule.The motivation for using a mixture model is that there may be a number of variations(or body configurations)for motions within the same action class.The model should adequately span the space of standard configurations for a given action.However,we are only interested infinding a representative set of these modes.We therefore use an information theoretic technique to select the best number of parameters to be used via MDL principle:Figure2:Tracking example:2bodies walking in different trajectories,occluding eachother.Figure3:Normalized views of the2bodies in the sequence,one row per body.6views with their respective regions of support.Figure4:Recovered(top view)motion.Note that motion of body1is from right to left.Body2goes in the opposite direction. Estimates at the beginning of the sequence are not very accurate, because error covariance in the EKF is higher.Uncertainty is reduced as enough samples are given.the second body moves in the opposite direction.While the early position estimates are noisy,after20-40framestheEKFconvergesto a stable estimate of the trajectories.6.1Learning and Recognition of ActionsIn order to test our the full action recognition system,wecollected sequences(3hours total)of random people per-forming different actions on a pedestrian road in a outdoorenvironment(Charles River sequences).We trained thesystem to recognize four different actions(walking,run-ning,roller blading,biking)gathered from two different camera viewpoints.The camera was located and angle with respect to the road.Video sequences showing56examples of each actionwere extracted from this data set.The duration of eachexample ranged from one tofive seconds(30-150frames).The recognition experiment was conducted as follows.For each trial,a subset of40training examples per action was select at random from the full example set.The re-maining examples per action(excluded from the test set) were then classified.Example frames from the data set are shown in Fig.5.As before,the estimated bounding boxes for each movingobject are shown overlaid on the input video image.Our approach indicated that only two trajectories where mainlyFigure5:Example frames taken from the river sequences.Actions Running Biking-0.120.35 Running-0.010.11-0.23 Biking0.02-Totals0.350.03Table1:Confusion matrix for classifying four action classes: walking,running,roller blading,and biking.In the experimental trials,the total probability of an error in classification (chance=0.75).observed:either direction along the foot path.There-fore,the system learned just two sets of PDF's ().Results for either view were almost the same;average rates are therefore presented.Classification performance is summarized in the con-fusion matrix shown in Tab.1.Each confusion matrix cell represents the probability of error in classification.The entry at is the probability of action being misclassi-fied as action.The last column is the total probability of a given action being misclassified as another action.The last row represents the probability of misclassification to action class.In the experimental trials,the total probability of an error in classification(chance=0.75). 6.2Sensitivity ExperimentsIn order to provide a more comprehensive analysis of the 3D trajectory estimation technique,we tested its sensitiv-ity with synthesized data sets.We conducted Monte Carlo experiments to evaluate the stability of trajectory estima-tion and prediction.In our experiments,two types of noise effects were tested:noise in the2D image measurements, and noise in the3D motion model.Test sequences were generated using a synthetic planar bounding box moving along varying directions in3D from a given starting position.The3D box was then projectedonto the image plane using our camera model(Eq.:1)with unit focal length.Each synthetic image sequence was100 frames long.The set of directions was sampled by the az-imuth and the rotation around the vector correspond-ing to.For sampling we use(different directions).For each experiment, each of the576possible trajectory directions was tested using15sequences with randomly perturbed inputs.All synthetic video sequences were sampled at a pixel resolution of.This was mapped to a physical viewport size of world units.Therefore one pixel width is equivalent to in world units.The depths of the object from the image plane ranged in a scale from to.This resulted in a projected bounding box that occupied approximately3%of the image on average.For all of our experiments we define the error in our es-timate at a given time to be measured in the image plane. The mean squared error(MSE)in estimating the bounding box corner positions was computed over the100frames within each test sequence.To better understand the effect of error due to differences in the projected size of the ob-ject from frame to frame,second error measure,normal-ized MSE was also computed.In this measure,the error at each frame was normalized by length of the projected bounding box diagonal.Figure6:Example of performance with significant measure-ment noise.The plots show error as a function trajectory direction().Normalized mean-square error(upper surface)and non-normalized mean-square error error surfaces(lower surface)are shown.Note that mean-square error varies almost exclusively with(azimuth).To test the sensitivity of the system to noise in the mea-surements,time varying white noise with variance was added to the measured bounding box corner positions at each frame.This was meant to simulate sensor noise and variations in bounding box due to non-rigid deformations of the object.To test the sensitivity of the model formula-tion to perturbations in the actual3D object trajectory,time varying white noise with variance was added to perturb the3D position of the object at each frame.The resulting trajectories were therefore not purely linear.Our experiments have consistently shown that the mean-square error depends exclusively on the azimuth an-gle of the trajectory,.An illustrative example,Fig.6 shows error surfaces for and.The plot shows the mean-square error and normalized mean-square error,over all possible directions.As can be seen,Figure7:Graphs showing the sensitivity with respect to varying levels of measurement noise.Thefirst graph shows the normal-ized mean-square error in the state estimate over various trajec-tory directions.The second graph shows the normalized mean-square error in the state predicted for the future frame. Figure8:Sensitivity with respect to varying levels of noise in the3D motion trajectory.Thefirst graph shows the normalized mean-square error in the state estimate over various trajectory di-rections.The second graph shows the normalized mean-square error in the state predicted.mean-square error is relatively invariant to.Due to this result,our graphs drop by averaging over it,so that the complexity of visualization is reduced.Fig.7shows results of experiments designed to test the effect of increasing the measurement noise.We set relatively low with respect to the real3D dimen-sions,,,and varied.As expected,the error is lower at lower noise levels.Thefirst graph shows the normalized mean-square error in the state estimate over various trajectory directions.The second graph shows the normalized mean-square error in the state predicted for the future frame(ten frames ahead).This error is due to the linearization step in the EKF.This error effects the accuracy of“look ahead”needed to foresee an occlusion, and to predict the state during occlusions.The graph in Fig.8shows the results of experiments designed to test the effect of increasing noise in the3D motion trajectory.This corresponds to noise added to the model.Here,is varied as shown,, ,and is kept relatively small. Note that is set to very high values with respect to the expected model noise.The normalized mean-square error in the position estimates is relatively constant over for each different level of noise and is also higher than the pre-diction error.The main reason for this is that the expected low measurement error tends to pull the estimates towards highly noisy measurements.The prediction error in gen-eral increases with and,showing the higher error in linearizing among the current state space point.The errorM e a n −s q u a r e d e r r o rFigure 9:Sensitivity with number of frames ahead used to calcu-late the prediction.Normalized mean-square error overdecreases after a given value for due to the normaliza-tion effect and the smaller effect that close to has with respect to changes on the image plane.In a final set of experiments,we tested the accuracythe trajectory prediction,at varyingframes into the fu-ture.Results are shown in Fig.9.Notice that as expected,the 3D trajectory prediction is more accurate in short time windows.The uncertainty increases with the number of frames in the future we want to make our prediction.This is mainly due to the fact that the EKF computes an approx-imation linearizing around the current point in state space,and as we pointed out the underlying process is non-linear.The prediction error in general increases with ,showing the higher error as consequence of linearization.7ConclusionWe have shown how to integrate low-level and mid-level mechanisms to achieve more robust and general tracking.3D trajectories can be successfully estimated,given some constraints on non-rigid objects.Prediction and estimation based on a 3D model gives improved performance over 2D image plane based prediction.This trajectory estimation can be used to predict and correct for occlusion.We utilized EKF 3D trajectory estimates in a new framework:Trajectory-Guided Recognition (TGR).This general method significantly reduces the complexity of ac-tion classification,and could be used with other techniques (e.g.,,[3,19]).Our tracking approach allows the construc-tion of an object centered representation.The resulting translation/scale stabilized images of the object are then fed to the TGR action recognition module that selects the appropriate classifier based on trajectory direction.The system was tested in classifying four basic actions in a large number of video sequences collected in uncon-strained,outdoor scenes.The noise stability properties of the trajectory estimation subsystem were also tested us-ing synthetic data sequences.The results of the exper-iments are encouraging.Classification performance was quite good,considering the complexity of the task.References[1]A.Azarbayejani and A.Pentland.Recursive estimation of motion,structure,and focal lenght.PAMI ,17(6),1995.[2]A.Baumberg and D.Hogg.Learning flexible models from image sequences.ECCV ,1994.[3]M.Black and Y Yacoob.Tracking and recognizing rigid and non-rigid facial motion using local parametric models of im-age motion.ICCV ,1995.[4]A.Bobick and J Davis.An appearance-based representation of action.ICPR ,1996.[5]K.Bradshaw,I.Reid,and D.Murray.The active recovery of 3d motion trajectories and their use in prediction.PAMI ,19(3),1997.[6]C.Bregler.Tracking people with twists and exponential maps.CVPR98,1998.[7]R.Chellappa T.Broida.Estimating the kinematics and struc-ture of a rigid object from a sequence of monocular images.PAMI ,13(6):497-513,1991.[8]T.Darrell and A.Pentland.Classifying hand gestures with a view-based distributed representation.NIPS ,1994.[9]J.Davis and A.F.Bobick.The representation and recognition of human movement using temporal templates.CVPR ,1997.[10]A.Dempster,ird,and D.Rubin.Maximum like-lihood estimation from incomplete data.J.of the Royal Stat.Soc.(B),39(1),1977.[11]K.Fukunaga.Introduction to Statistical Pattern Recognition .Academic Press,1972.[12]D.Gavrila and L.Davis.Tracking of humans in action:a 3-dmodel-based approac.Proc.ARPA IUE Workshop ,1996.[13]L.Davis I.Haritaouglu,D.Harwood.W4s:A realtime sys-tem for detecting and tracking people in 2.5d.ECCV ,1998.[14]S.Intille and A.F.Bobick.Real time close world tracking.CVPR ,1997.[15]S.Ju,M.Black,and Y .Yacoob.Cardboard people:A param-eterized model of articulated image motion.Proc.Gesture Recognition ,1996.[16]I.Kakadiaris, D.Metaxas,and R.Bajcsy.Active part-decomposition,shape and motion estimation of articulated objects:A physics-based approach.CVPR ,1994.[17]T.Kohonen.Self-organized formation of topologically cor-rect feature maps.Bio.Cybernetics ,43:59-69,1982.[18]A.Pentland and B.Horowitz.Recovery of non-rigid motionand structure.PAMI ,13(7):730–742,1991.[19]R.Polana and R.Nelson.Low level recognition of humanmotion.Proc.IEEE Workshop on Nonrigid and Articulate Motion ,1994.[20]B.Rao,H.Durrant-Whyte,,and J.Sheen.A fully decentral-ized multi-sensor system for tracking and surveillance.IJRR ,12(1),1993.[21]J.M.Regh and T.Kanade.Model-based tracking of self-occluding articulated objects.ICCV ,1995.[22]D.Reynard, A.Wildenberg, A.Blake,and J.Marchant.Learning dynamics of complex motions from image se-quences.ECCV ,1996.[23]K.Rohr.Towards model-based recognition of human move-ments in image sequences.CVGIP:IU ,59(1):94-115,1994.[24]R.Rosales and S.Sclaroff.Improved tracking of multiplehumans with trajectory prediction and occlusion modeling.IEEE CVPR Workshop on the Interp.of Visual Motion ,1998.[25]R.Rosales and S.Sclaroff.Trajectory guided tracking andrecognition actions.TR BU-CS-99-002,Boston U.,1999.[26]M.Shah and R.Jain.Motion-Based Recognition .KluwerAcademic,1997.[27]H.W.Sorenson.Least-squares estimation:From gauss tokalman.IEEE Spectrum ,V ol.7,pp.63-68,1970.[28]R.Szeliski and S.Kang.Recovering 3d shape and motionfrom image streams using non-linear least squares.CVPR ,1993.[29]G.Welch and G.Bishop.An introduction to the kalman fil-ter,.TR 95-041,Computer Science,UNC Chapel Hill,1995.[30]C.Wren, A.Azarbayejani,T.Darrell,and A.Pentland.Pfinder:Real time tracking of the human body.TR 353,MIT Media Lab,1996.。
航空器轨迹预测技术研究综述
20215712据预测,未来20年,全球航空运输年增长率约为4.4%,中国空中交通量将增长3.5倍[1],这对民航界的发展提出了重大的挑战。
而目前的空中交通管理(Air Traffic Management,ATM)系统在操作、功能和技术层面上是分散的,导致了航班延误、空域拥堵、管制员工作负荷较大以及需求和容量失衡等一系列问题[2-3]。
因此,ATM系统中出现了许多决策支持工具(Decision Support Tools,DST),旨在帮助管制员进行冲突检测和解脱、进场排序以及航空器异常行为监测等,确保飞行安全,提高运行效率,减轻管制员工作负荷,扩大空域容量[4-6]。
而航迹预测是所有DST的基础,能够极大地降低航空器未来飞行的不确定性,提高空中交通的可预测性。
同时,航迹预测也成为了现代空管自动化系统的核心技术。
另外,为了克服ATM系统的缺陷,应对日益增长的航空运输需求,许多国家和组织提出了改造项目,如国际民用航空组织的航空系统组块升级框架、欧洲的单一航空器轨迹预测技术研究综述徐正凤,曾维理,羊钊南京航空航天大学民航学院,南京211106摘要:航空器轨迹预测是流量管理、冲突检测和解脱、航空器进场排序以及异常行为监测等空中交通管理技术的基础。
关于航空器轨迹预测的研究产生了许多经典的方法和应用领域。
对研究航迹预测问题的背景和意义进行概述,并从数据库、基础流程和预测关键技术三个方面介绍了有关航迹预测的基础知识。
其中数据库包括航空器性能数据库、航空器监视数据库和气象数据库,基础流程包括准备、预测、更新和输出四个模块,预测关键技术总结并列举了状态估计模型、动力学模型和机器学习模型三类方法的典型模型。
对航迹预测系统模型进行具体分析时,进一步列举三类方法的主要研究成果并归纳各类方法的特点。
对航迹预测在空中交通管理中的具体应用进行分析,包括冲突检测、到达管理和流量管理等。
总结并指出了目前航迹预测问题所面临的挑战和未来的发展方向。
Apparatus and method for detecting moving objects
专利名称:Apparatus and method for detecting movingobjects发明人:Larry W. Fullerton,James Richards申请号:US10856037申请日:20040528公开号:US07132975B2公开日:20061107专利内容由知识产权出版社提供专利附图:摘要:An ultra wideband radar system for detecting moving objects comprising an antenna, which may be scanned in at least one dimension, and a signal processor wherein the signal processor includes a scan combiner that combines scan information inaccordance with a candidate trajectory for the moving object. Scans may be combined by integration or filtering. A fast calculation method is described wherein the scans are combined into subsets and subsets are shifted in accordance with the candidate trajectory before further combination. A method is described wherein a region is scanned with an ultra wideband radar, the scan information is combined in accordance with an expected trajectory to enhance the object signal to noise. Further features are described wherein the scan information is combined according to a family of trajectories. A trajectory yielding a potential object detection initiates a further scan combination step wherein the family of trajectories is further resolved.申请人:Larry W. Fullerton,James Richards地址:Brownsboro AL US,Fayetteville TN US国籍:US,US代理人:James Richards更多信息请下载全文后查看。
移动机器人动态环境下目标跟踪异构传感器一致性观测方法
第35卷第6期2015年6月Vol.35,No.6June,2015光学学报ACTA OPTICA SINICA移动机器人动态环境下目标跟踪异构传感器一致性观测方法伍明李琳琳魏振华汪洪桥中国人民解放军第二炮兵工程学院,陕西西安710025摘要为了解决机器人同时定位,地图构建与目标跟踪(SLAMOT)过程中的多源,异构传感器空间一致性观测问题,提出了基于信息融合的摄像机与激光测距传感器联合标定优化方法。
完成基于误差传播公式的激光扫描点图像平面投影不确定范围判定,并利用协方差交集算法实现基于运动物体检验方法和基于Camshift 方法的图像坐标系下目标状态融合。
在此基础上,利用目标图像平面投影方向误差构造目标函数,通过非线性优化方法实现摄像机与激光测距仪标定参数优化。
实验验证了设计方法能有效提高目标跟踪以及多传感器参数标定的准确性。
相关成果能够为基于多传感器信息融合的机器人同时定位,地图构建与目标跟踪滤波方法研究提供观测值支持。
关键词机器视觉;摄像机与激光测距仪联合标定;多传感器信息融合;机器人同时定位,地图构建与目标跟踪中图分类号TP2342.6文献标识码Adoi:10.3788/AOS201535.0615002Observation Consistency for Moving Object Tracking with MobileRobot in Dynamic EnvironmentsWu MingLi LinlinWei ZhenhuaWang HongqiaoThe Second Artillery Engineering College,Xi′an,Shaanxi 710025,ChinaAbstract In order to solve the problem of spatial observation consistency from heterogeneous multi-sensor in the process of simultaneous localization,mapping and object tracking (SLAMOT),a calibration optimization method of camera and laser range measuring sensor based on information fusion is proposed.Uncertain arera of laser scanning point image plane projection is determined based on error propagation formula,and a covariance intersection based method which fuses informations come from moving object detection and Camshift method to object state estimation is designed.On this basis,the objective function is constructed with bearing error of object image projection,and calibration parameters of camera and laser range finder are optimized using nonlinear optimization method.Experiments show that the designed method improves accuracy of both object tracking and multi-sensors calibration.The method offers measurements which support further research of SLAMOT filter based on multi-sensor information fusion.Key wordsmachine vision;calibration of camera and laser range finder;multi-sensor information fusion;simultaneous localization,mapping and object tracking of robot OCIS codes 150.1488;150.4232;150.5758;140.7300.收稿日期:2014-12-23;收到修改稿日期:2015-02-04基金项目:国家自然科学基金(61202332)、陕西省自然科学基金(2013JQ8030)作者简介:伍明(1981—),男,博士,讲师,主要从事机器视觉,智能机器人技术等方面研究。
牛顿第一定律(英文)
An Object in Motion
• A dynamic cart with a brick on it. • Get it moving and stopped. • Tape the brick to the cart. • Get it moving and stopped again. • Seat belts protect us from being hurt
Newton's First Law of Motion
Law of ton's First Law of Motion
• Every object in a state of uniform motion tends to remain in that state of motion unless an unbalanced force is applied to it.
• F = ma
m: inertial mass
Application to everyday life
• Opening a bottle • Removing dusts from cloths • Seat belts • Seismometer
Seat Belt
• Seat belts can exert forces to cause passengers to slow down at the same rate as the vehicle.
by keeping us tied to the vehicle.
An Object in Motion
Inertia
• The resistance an object has to a change in its state of motion.
基于ROS系统的无人配送智能车设计
第13卷㊀第6期Vol.13No.6㊀㊀智㊀能㊀计㊀算㊀机㊀与㊀应㊀用IntelligentComputerandApplications㊀㊀2023年6月㊀Jun.2023㊀㊀㊀㊀㊀㊀文章编号:2095-2163(2023)06-0126-04中图分类号:TP242文献标志码:A基于ROS系统的无人配送智能车设计张雨晴1,吕㊀程2,高金凤1(1浙江理工大学信息科学与工程学院,杭州310018;2杭州市水务集团有限公司,杭州310009)摘㊀要:传统的无人配送智能车功能单一,体积较大,难以适用于狭小复杂的工作环境㊂为此,本文设计了一款基于ROS(RobotOperatingSystem)操作系统的简易配送智能车㊂该智能车使用ROS操作系统作为平台,由ROS控制器和STM32运动控制器组成,地图构建采用SLAM(SimultaneousLocalizationandMapping)建图算法,规划路径采用全局和局部相结合的路径规划算法㊂该智能车集成程度高,体积小,适用于多种场合,具有良好的社会效益㊂关键词:ROS;配送智能车;路径规划DesignofunmannedintelligentdeliveryvehiclebasedonROSsystemZHANGYuqing1,LVCheng2,GAOJinfeng1(1SchoolofInformationScienceandTechnology,ZhejiangSci-TechUniversity,Hangzhou310018,China;2HangzhouWaterGroupCo.,Ltd,Hangzhou310009,China)ʌAbstractɔThetraditionalunmannedintelligentdeliveryvehiclehassomelimitationsofsimplefunctionandlargebulk,whichisdifficulttoapplyinthenarrowandcomplexworkingenvironment.WedesignasimpledeliveryintelligentvehiclebasedonROS(RobotOperatingSystem)system.ThesmartvehicleusesROSoperatingsystemastheplatformandiscomposedofROScontrollerframeworkandSTM32motioncontrolframework.ThemapbuildingadoptstheSLAM(SimultaneousLocalizationandMapping)mappingalgorithm,andthepathplanningadoptsacombinationofglobalandlocalpathplanningalgorithms.Inaddition,thesmartvehicleishighlyintegratedandsmallinsize,whichissuitableforvariousworkingenvironmentsuchashotelsandhospitals.ʌKeywordsɔROS;intelligentdeliveryvehicle;pathplanning基金项目:国家自然科学基金(62073296);浙江省自然科学基金(LY20F030015)㊂作者简介:张雨晴(1999-),女,硕士研究生,主要研究方向:机器人操作系统㊁自主导航与智能控制;吕㊀程(1990-),男,学士,助理工程师,主要研究方向:机械与电气自动化设备技术应用;高金凤(1978-),女,博士,教授,主要研究方向:先进控制理论与故障诊断技术㊂通讯作者:高金凤㊀㊀Email:jfgao@zstu.edu.cn收稿日期:2023-03-250㊀引㊀言随着科学技术的进步,机器人技术不断创新,已经在餐饮㊁物流等领域起着重要作用,代替人类从事危险㊁重复和繁琐的工作㊂无接触配送智能车是一种可以节省劳动力的工具㊂然而,当前的无接触配送小车操作繁琐㊁功能单一㊁自动化程度不高,尤其是在狭小㊁拥挤的动态环境中无法胜任配送工作[1]㊂提升智能车的集成程度㊁运动路径精度,规划出更合理㊁时间更短㊁平滑性更高和误差更小的移动路径等问题已成为研究的重点[2]㊂本文设计了一款基于ROS操作系统的多功能无人配送智能车,该智能车可通过遥控㊁语音导航和运动跟随3种方式控制,以实现物资的配送㊂1㊀硬件结构方案1.1㊀总体框架远程控制设备和无人配送智能车的连接示意图如图1所示㊂该智能车基于ROS机器人操作系统,包括远程控制设备㊁配送小车和无线网络系统,其中配送小车和远程遥控设备需处于同一无线局域网中㊂该智能车包括储物筐和移动底盘,移动底盘采用3层平台结构,移动底盘的上层设有深度摄像机㊁麦克风语音装置㊁WIFI模块和激光雷达导航避障装置;中层设有单片机驱动板和上位机;下层设有电源扩展板和麦克纳姆轮㊂上位机控制激光雷达导航避障装置和深度摄像机㊂通过遥控㊁语音导航和运动跟随3种方式,控制智能车进行配送任务㊂图1㊀远程控制设备与无人配送智能车连接示意图Fig.1㊀Connectiondiagramofremotecontrolandunmannedintelligentdeliveryvehicle㊀㊀智能车平台总体架构图如图2所示㊂该智能车平台的总体架构由软件控制系统层㊁硬件层和驱动层3部分组成㊂硬件层包括惯性测量单元㊁深度摄像机㊁激光雷达㊁里程计和电机㊂思岚A1激光雷达和乐视深度摄像机将采集到的数据直接发送给上位机,惯性测量单元㊁里程计和电机由下位机控制㊂软件控制系统层包括能够实现建图功能的功能包㊁导航框架和路径规划功能包㊂1.2㊀控制组成该智能车控制系统由ROS机器人操作系统和STM32运动控制器组成㊂ROS机器人操作系统控制激光雷达导航避障装置和深度摄像机,并将处理后的信息实时传输给同一局域网上的远程遥控设备㊂远程遥控设备接收信息后发送指令给STM32运动控制器,从而控制小车的运动[3]㊂ROS机器人操作系统安装在PC上作为上位机,其主要模块是定位导航模块㊂运动信息通过上位机传送给STM32下位机,下位机通过订阅话题的方式接收并使用PID(ProportionIntegrationDifferentiation)算法调节电机的速度,向上位机传运动数据和传感器信息[4]㊂导航框架传感数据采集器电机控制S L A M 外设驱动U A R T 驱动I M U 驱动E X I T 驱动激光雷达驱动编码器驱动电机驱动A D C 驱动I /O 扩展电机驱动刷外设激光雷达I M U 里程计电机A R MC o r t e x -A 53S T M 32F 103C 8T 6机械平台硬件中间件处理器硬件层驱动层操作系统层R O S 模块图2㊀智能车平台总体架构图Fig.2㊀Overallarchitectureofintelligentvehicleplatform2㊀软件设计方案该无人配送智能车使用ROS机器人操作系统作为平台,应用GmappingSLAM(SimultaneousLocalizationandMapping)建图算法将激光雷达采集的环境信息进行建图㊂用AMCL(AdaptiveMonteCarloLocalization)自适应蒙特卡洛定位算法实现精确定位[5],同时结合A∗全局路径规划算法和DWA(DynamicWindowApproach)局部路径规划算法,以规划出最优路径㊂此外,为了提高适用性,该系统还设计了跟随和语音导航功能㊂2.1㊀无人配送智能车的地图构建构建地图是实现智能车定位导航㊁路径规划和自主移动工作的前提条件㊂采用SLAM建图理论,智能车在未知环境中移动,利用脉冲式激光传感器获取周围环境信息㊂传感器向周围发射脉冲信号,接收回波信号,通过计时电路计算激光往返时间来确定智能车与障碍物的距离,从而构建地图㊂该智能车使用开源Gmapping功能包订阅里程计㊁惯性测量单元和深度信息,同时完成一些必要的参数设置㊂721第6期张雨晴,等:基于ROS系统的无人配送智能车设计2.2㊀无人配送智能车的定位导航定位过程:首先,通过智能车不同位置坐标系之间的变换关系,可以显示运动状态;其次,利用基于扩展卡尔曼滤波算法的robot_pose_ekf算法,轮式里程计的数据和惯性测量单元的信息融合滤波并输出;最后,通过AMCL定位框架在已知地图中进行智能车定位,实现持续定位跟踪[6]㊂2.3㊀无人配送智能车的语音交互该智能车的语音交互系统由语音唤醒㊁语音采集㊁命令词识别和语音合成等部分组成㊂语音识别采用的是开源的科大讯飞公司的语音功能包,能够将采集到的语音转化为文本,通过命令词识别功能,将语音指令转换为对应的地点名称和坐标,并发布到智能车的控制话题中,以实现准确到达目标位置的目的㊂2.4㊀无人配送智能车的路径规划对针对静态地图使用A∗算法可以快速有效地规划出全局地图的最佳路径,但无法很好应对动态环境[7]㊂DWA算法则能够使机器人很好地处理小范围的动态环境,避开障碍物,但规划出的路径不一定是最优路径[8]㊂因此,本文通过路径规划功能包将A∗全局路径规划算法和DWA局部路径规划算法结合起来㊂在智能车构建生成地图后,首先通过A∗算法规划出全局最优路径规划,让智能车按照该路径行驶㊂在行驶过程中,如果动态环境影响到下一个路径并导致节点被占用,就使用DWA算法规划出动态的局部路径,使智能车绕过障碍物,回到A∗规划的路径㊂2.4.1㊀全局路径规划算法改进A∗算法结合了具有全局性特点的Dijkstra算法和最佳优先算法BFS(BestFirstSearch)㊂Dijkstra算法被广泛用于智能车路径规划的全局搜索㊂虽然BFS算法可以减小Dijkstra算法的搜索范围,但是规划出的路径不一定是最优路径㊂改进后的A∗算法可以减少传统的A∗算法在路径规划时会产生冗余点和拐点的问题㊂A∗算法示意图如图3所示㊂起点(x0,y0)目标点(x2,y2)父节点(x2,y2)当前点(x1,y1)g(n)c(n)h(n)图3㊀A∗算法示意图Fig.3㊀A∗algorithmdiagram㊀㊀A∗算法的评价函数,式(1):f(n)=g(n)+h(n)(1)㊀㊀当前点的评价函数f(n)由过去成本函数g(n)和当前成本函数h(n)组成,过去成本函数是起点(x0,y0)到当前点(x1,y1)的距离,当前成本函数当前点(x1,y1)到目标点(x2,y2)的距离,式(2)和式(3):g(n)=(x1-x0)2+(y1-y0)2(2)h(n)=(x2-x1)2+(y2-y1)2(3)㊀㊀这种算法通过改进评价函数的计算方式,降低了算法的计算量,从而能更加快速有效地生成平滑路径㊂当h(n)权重比过大时,虽然能够减少寻路的工作量,但是不能规划出最佳路径;而当h(n)权重比过小时,虽然可以规划出最佳路径,但是工作量较大,通过引入权重比例系数改变评价函数的权重比,改善路径,以及通过节点优化改进路径生成策略㊂2.4.2㊀局部路径规划算法改进本文提出了一种改进的动态窗口法,可以有效解决无人配送智能车在局部路径规划时加速度超出规定范围和实际路径偏离全局路径过多之类的问题㊂该方法分为两步:首先对智能车自身的速度空间进行动力学约束㊁运动学约束和障碍物约束;其次,对速度空间的数据采样后,利用动力学公式进行轨迹推算㊂轨迹推算示意图如图4所示㊂y wyo w xwdθdθ1d y1d y d x1d xx rθy ro rx图4㊀轨迹推算示意图Fig.4㊀Schematicdiagramoftrajectoryestimation㊀㊀在不考虑路况的理想情况下,轨迹推算公式(4)如下:xt+dtyt+dtzt+dtéëêêêêùûúúúú=xtytθtéëêêêêùûúúúú+cosθ-sinθ0sinθcosθ0001æèçççöø÷÷÷+dxdydθéëêêêùûúúú(4)㊀㊀其中,[xt+dt,yt+dt,θt+dt,]T是t+dt时刻小车在世界坐标系下的位姿,[xt,yt,θt]T是t时刻小车在世界坐标系下的位姿,[dx,dy,dθ]是dt时间内小车在底盘坐标系下的理想变化量㊂实际轨迹推算公式中,应该考虑误差对于dt时间内智能车底盘坐标的变化量的影响㊂821智㊀能㊀计㊀算㊀机㊀与㊀应㊀用㊀㊀㊀㊀㊀㊀㊀㊀㊀㊀㊀㊀㊀㊀第13卷㊀假设激光里程计测量出的数据ui∗=[u∗ix,u∗iy,u∗iθ]T和轮式里程计测量出的数据ui==[uix,uiy,uiθ]T关系是线性的,式(5):u∗ixu∗iyu∗iθéëêêêêùûúúúú=a11a12a13a21a22a23a31a32a33æèçççöø÷÷÷uixuiyuiθéëêêêêùûúúúú(5)㊀㊀其中,a11a12a13a21a22a23a31a32a33éëêêêêùûúúúú为两者的系数㊂误差补偿后的公式(6):xt+dtyt+dtzt+dtéëêêêêùûúúúú=xtytθtéëêêêêùûúúúú+cosθ-sinθ0sinθcosθ0001æèçççöø÷÷÷a11a12a13a21a22a23a31a32a33æèçççöø÷÷÷+dxdydθéëêêêùûúúú(6)该算法首先通过DWA算法对速度进行动力学约束,把智能车加速度控制在不会导致轮胎垂直载荷过小的合理范围内㊂其次,该算法对轨迹误差进行闭环的补偿,从而减少了实际路径和全局路径的误差㊂3㊀实㊀验3.1㊀功能测试本实验在构建的地图上设置了多个目标点和巡航路线,通过QTCreator开发的遥控软件或语音指令,用户可以轻松地遥控智能车㊂3.2㊀算法验证经过将改进后的A∗算法与传统的A∗算法进行仿真实验对比,不同A∗算法寻路时间对比见表1,表明改进的A∗算法路径查找时间更短㊂㊀㊀经过仿真实验比较传统的局部路径规划算法和改进后的局部路径规划算法,传统DWA和改进DWA精确度对比见表2,优化后的DWA路径规划算法比传统DWA路径规划算法的误差更小㊂表1㊀不同A∗算法寻路时间对比Tab.1㊀ComparisonofpathfindingtimeofdifferentA∗algorithms算法名称寻路时间/s传统A∗算法7.53改进A∗算法7.45表2㊀传统DWA和改进DWA精确度对比Tab.2㊀ComparisonofaccuracybetweentraditionalDWAandimprovedDWA算法平均误差传统DWA0.051改进DWA0.0184㊀结束语本文设计了一种无人配送智能车,该智能车具备良好的语音交互特性㊁准确建图和精准定位能力,以及运动跟随和精准配送功能㊂在改进后的路径规划算法的支持下,该智能车能够更快更精确地到达目的地㊂未来的研究可以进一步优化无人配送智能车的性能,以满足不同应用场景的需求㊂参考文献[1]徐佳慧.基于城市场景的无人机配送任务规划研究[D].北京交通大学,2021.[2]杜霈.基于自适应融合算法的无人售卖车动态路径规划方法[D].重庆:重庆交通大学2022.[3]李思达.基于测距仪阵列的固态激光雷达空间探测平台研究与搭建[D].长春:吉林大学,2022.[4]杨紫阳.大型粮面自主巡视机器人控制系统设计[D].河南:河南工业大学,2020.[5]宋凯.基于激光SLAM的室内移动机器人定位可靠性增强策略研究[D].山东:山东大学,2022.[6]陈鸿宇.基于激光雷达的自主导航地坪磨抛机算法研究[D].厦门:厦门理工学院,2022.[7]叶明,周俊充,郑毅,等.封闭园区内无人驾驶洗扫车路径规划及控制[J/OL].计算机应用研究:1-8[2023-02-25].[8]尹婉秋.基于改进A∗算法的无人车变速避障路径规划研究[D].重庆:重庆理工大学,2022.(上接第125页)[6]苏彬彬.基于数据包络模型的我国社区卫生机构资源配置效率分析[J].中国卫生政策研究,2021,14(6):51-57.[7]孙伟鑫.吉林省基层医疗卫生机构卫生资源配置效率和公平性研究[D].长春:吉林大学,2020.[8]赵信,李军.DEA联合其他综合评价系统分析方法用于医疗机构的效率评价述评[J].中国卫生统计,2020,37(2):313-316.[9]陈冠南,杨臻煌.基于DEA-Malmquist模型的我国公共医疗卫生资源配置效率评价研究 以我国30个省市地区的数据为例[J].福建医科大学学报(社会科学版),2022,23(4):14-22.[10]李保婵,薛晓璐.基于DEA的广西基本医疗保险对医疗服务影响研究[J].中国市场,2018(13):41-42,48.921第6期张雨晴,等:基于ROS系统的无人配送智能车设计。
- 1、下载文档前请自行甄别文档内容的完整性,平台不提供额外的编辑、内容补充、找答案等附加服务。
- 2、"仅部分预览"的文档,不可在线预览部分如存在完整性等问题,可反馈申请退款(可完整预览的文档不适用该条件!)。
- 3、如文档侵犯您的权益,请联系客服反馈,我们会尽快为您处理(人工客服工作时间:9:00-18:30)。
S(k x , k y ,ω ) using an optical Fourier processor. If only
the real part is recovered, the frequency domain representation is given by,
reflection of the other in the kx-ky plane. The first plane represents an object moving along a trajectory with velocity vector v = [vx vy] while the second plane represents an object moving along the same path but in the opposite direction, v' = [-vx -vy] = -v. The target’s velocity can be determined by solving for the slope of one of the planes.
extension to that of Knudsen where by the 2D spatial component of the computationally intensive FT is determined using an optical processor rather than a conventional electronic processor. The present implementation estimates the trajectory of a single moving object; however, the computational savings realized through the optical processor would allow realtime multiple-target trajectory estimation.
3. EXPERIMENTAL
The trajectory estimation system shown in Figure 1 consists of a personal computer (PC) and an optical Fourier transform coprocessor. A sequence of images
Moving Object Trajectory Estimation Using an Optical Fourier Processor
Pierre Lane, K. Steven Knudsen†, and Michael Cada
DalTecha, Dalhousie University, Electrical and Computer Engineering Dept. P.O. Box 1000, Halifax, NS B3J 2X4, Canada
s(x, y, n)= δ (x - v x n - x0 ) δ (y - v y n - y0) (1)
where n is the integer frame number. The linear trajectory of a single object therefore describes a line in the 3D spatiotemporal domain. The mixed domain
π exp(− iφt )δ (ω + ωt ) + π exp(iφt )δ (ω − ωt ) (4)
and the energy of the FT is confined to a pair of planes defined by k x vx + k y vy ±ω = 0 . One plane is the
†Resolute Research Ltd., 24 Midridge Rise N.E., Calgary, AB T2X 1E3, Canada
ABSTRACT
A vision system that estimates the trajectory (velocity and direction) of moving targets in a two-dimensional field at video frame rates has been developed and constructed. The system uses an optical Fourier processor to calculate the frequency domain representation of moving objects from which their trajectory is estimated using conventional electronic processing techniques. In a series of experiments, target velocities were estimated to within 4 percent of their actual value and direction was estimated to within 3 degrees.
S(k x , k y ,ω ) =
∞
å
S(k x , k y , n)exp(− iω n)
(3)
n= -∞
= 2π exp(iφt )δ (ω − ωt )
The energy of the FT is confined to a plane in 3D frequency space defined by, k x vx + k y v y − ω = 0 . It is
representation is calculated by Fourier transforming the spatial dimensions,
[ ] ( ) ∞ ∞
(S k x , k y ,n) = ò ò s(x, y,n) exp i kx x + k y y dxdy (2) -∞ -∞ = exp[i(ωt n +φt )]
Keywords: Trajectory estimation; Fourier processor; Smartt interferometry; Mixed domain processing.
1. INTRODUCTION
We take for granted the ability to discern objects, estimate their motion, and navigate in threedimensional spaces using our biological vision system. Duplicating these capabilities in a machine vision system, even to a limited degree, has proved to be a very difficult task indeed1. The computational power required for even a basic vision system seems to transcend the capabilities of traditional electronic processors.
where ωt = k x vx + k y vy and φt = k x x0 + k y y0 . The
mixed domain representation of a moving object can be interpreted as a complex 1D sinusoidal sequence in n with temporal frequency ÿt and phase φt. The frequency is determined by the velocity of the object and the phase is determined by its initial position. The frequency domain representation is calculated by Fourier transforming the temporal dimension of the mixed domain signal,
Consider an object with velocity v = [vx vy] and initial position (x0, y0), moving along a line in the x-y plane. The absolute position of the object in space-time is described by,
2. THEORY
Trajectory estimation is typically performed in the temporal domain2-4or the frequency domain5-8. The method presented here is based on the theory of mixeddomain signal processing9 developed by Knudsen and Bruton. Knudsen has successfully applied their signal processing algorithms to the trajectory estimation10 of multiple targets. In general, the frequency domain approach to trajectory estimation involves the calculation of a three-dimensional (3D) spatiotemporal Fourier transform (FT). The work described here is an