87 resultados para Radar tracking and ranging
Resumo:
Vision trackers have been proposed as a promising alternative for tracking at large-scale, congested construction sites. They provide the location of a large number of entities in a camera view across frames. However, vision trackers provide only two-dimensional (2D) pixel coordinates, which are not adequate for construction applications. This paper proposes and validates a method that overcomes this limitation by employing stereo cameras and converting 2D pixel coordinates to three-dimensional (3D) metric coordinates. The proposed method consists of four steps: camera calibration, camera pose estimation, 2D tracking, and triangulation. Given that the method employs fixed, calibrated stereo cameras with a long baseline, appropriate algorithms are selected for each step. Once the first two steps reveal camera system parameters, the third step determines 2D pixel coordinates of entities in subsequent frames. The 2D coordinates are triangulated on the basis of the camera system parameters to obtain 3D coordinates. The methodology presented in this paper has been implemented and tested with data collected from a construction site. The results demonstrate the suitability of this method for on-site tracking purposes.
Resumo:
Visual recognition problems often involve classification of myriads of pixels, across scales, to locate objects of interest in an image or to segment images according to object classes. The requirement for high speed and accuracy makes the problems very challenging and has motivated studies on efficient classification algorithms. A novel multi-classifier boosting algorithm is proposed to tackle the multimodal problems by simultaneously clustering samples and boosting classifiers in Section 2. The method is extended into an online version for object tracking in Section 3. Section 4 presents a tree-structured classifier, called Super tree, to further speed up the classification time of a standard boosting classifier. The proposed methods are demonstrated for object detection, tracking and segmentation tasks. © 2013 Springer-Verlag Berlin Heidelberg.
Resumo:
This technical report presents a method for designing a constrained output-feedback model predictive controller (MPC) that behaves in the same way as an existing baseline stabilising linear time invariant output-feedback controller when constraints are inactive. The baseline controller is cast into an observer-compensator form and an inverse-optimal cost function is used as the basis of the MPC controller. The available degrees of design freedom are explored, and some guidelines provided for the selection of an appropriate observer-compensator realisation that will best allow exploitation of the constraint-handling and redundancy management capabilities of MPC. Consideration is given to output setpoint tracking, and the method is demonstrated with three different multivariable plants of varying complexity.
Resumo:
This paper develops a path-following steering control strategy for an articulated heavy goods vehicle. The controller steers the axles of the semi-trailer so that its rear end follows the path of the fifth wheel coupling: for all paths and all speeds. This substantially improves low-speed manoeuvrability, off-tracking, and tyre scrubbing (wear). It also increases high-speed stability, reduces 'rearward amplification', and reduces the propensity to roll over in high-speed transient manoeuvres. The design of a novel experimental heavy goods vehicle with three independent hydraulically actuated steering axles is presented. The path-following controller is tested on the experimental vehicle, at low and high speeds. The field test results are compared with vehicle simulations and found to agree well. The benefits of this steering control approach are quantified. In a low-speed 'roundabout' manoeuvre, low-speed off-tracking was reduced by 73 per cent, from 4.25 m for a conventional vehicle to 1.15 m for the experimental vehicle; swept-path width was reduced by 2 m (28 per cent); peak scrubbing tyre forces were reduced by 83 per cent; and entry tail-swing was eliminated. In an 80 km/h lane-change manoeuvre, peak path error for the experimental vehicle was 33 per cent less than for the conventional vehicle, and rearward amplification of the trailer was 35 per cent less. Increasing the bandwidth of the steering actuators improved the high-speed dynamic performance of the vehicle, but at the expense of increased oil flow.
Resumo:
Self-biased Terfenol-D 2-2 composites exhibit high frequency of actuation and good magnetomechanical properties; however, their potential usefulness is highly dependent on their magnetoacoustic properties, particularly for ultrasonic applications. The speed of sound, c, and its variation with an externally applied magnetic field have been measured for the above composites using a 10 MHz longitudinal pulse. When the sound propagates parallel to the layers, the acoustic impedance was found to be independent of the external applied field, and lower than that for bulk Terfenol-D. The magnetomechanical coupling coefficient was found to be generally low (up to 0.35) and dependent on the volume ratio of materials, being higher for the specimens with greater content of Terfenol-D. The low attenuation, low acoustic impedance, and high frequency of actuation make this structure an interesting alternative for use in underwatersound navigation and ranging and other ultrasonic applications. When the pulse propagates orthogonal to the layers, c was found to vary by up to 3% with the application of an external field, but the acoustic attenuation was found to be very high due to the multiple reflections produced at the interfaces between the layers. This latter phenomenon has been calculated theoretically. © 2007 American Institute of Physics.
Resumo:
A simple and general design procedure is presented for the polarisation diversity of arbitrary conformal arrays; this procedure is based on the mathematical framework of geometric algebra and can be solved optimally using convex optimisation. Aside from being simpler and more direct than other derivations in the literature, this derivation is also entirely general in that it expresses the transformations in terms of rotors in geometric algebra which can easily be formulated for any arbitrary conformal array geometry. Convex optimisation has a number of advantages; solvers are widespread and freely available, the process generally requires a small number of iterations and a wide variety of constraints can be readily incorporated. The study outlines a two-step approach for addressing polarisation diversity in arbitrary conformal arrays: first, the authors obtain the array polarisation patterns using geometric algebra and secondly use a convex optimisation approach to find the optimal weights for the polarisation diversity problem. The versatility of this approach is illustrated via simulations of a 7×10 cylindrical conformal array. © 2012 The Institution of Engineering and Technology.
Resumo:
This paper presents a novel way to speed up the evaluation time of a boosting classifier. We make a shallow (flat) network deep (hierarchical) by growing a tree from decision regions of a given boosting classifier. The tree provides many short paths for speeding up while preserving the reasonably smooth decision regions of the boosting classifier for good generalisation. For converting a boosting classifier into a decision tree, we formulate a Boolean optimization problem, which has been previously studied for circuit design but limited to a small number of binary variables. In this work, a novel optimisation method is proposed for, firstly, several tens of variables i.e. weak-learners of a boosting classifier, and then any larger number of weak-learners by using a two-stage cascade. Experiments on the synthetic and face image data sets show that the obtained tree achieves a significant speed up both over a standard boosting classifier and the Fast-exit-a previously described method for speeding-up boosting classification, at the same accuracy. The proposed method as a general meta-algorithm is also useful for a boosting cascade, where it speeds up individual stage classifiers by different gains. The proposed method is further demonstrated for fast-moving object tracking and segmentation problems. © 2011 Springer Science+Business Media, LLC.
Resumo:
This paper studies some extensions to the decentralized attitude synchronization of identical rigid bodies. Considering fully actuated Euler equations, the communication links between the rigid bodies are limited and the available information is restricted to relative orientations and angular velocities. In particular, no leader nor external reference dictates the swarm's behavior. The control laws are derived using two classical approaches of nonlinear control - tracking and energy shaping. This leads to a comparison of two corresponding methods which are currently considered for distributed synchronization - consensus and stabilization of mechanical systems with symmetries. © 2007 IEEE.
Resumo:
Alternative and more efficient computational methods can extend the applicability of model predictive control (MPC) to systems with tight real-time requirements. This paper presents a system-on-a-chip MPC system, implemented on a field-programmable gate array (FPGA), consisting of a sparse structure-exploiting primal dual interior point (PDIP) quadratic program (QP) solver for MPC reference tracking and a fast gradient QP solver for steady-state target calculation. A parallel reduced precision iterative solver is used to accelerate the solution of the set of linear equations forming the computational bottleneck of the PDIP algorithm. A numerical study of the effect of reducing the number of iterations highlights the effectiveness of the approach. The system is demonstrated with an FPGA-in-the-loop testbench controlling a nonlinear simulation of a large airliner. This paper considers many more manipulated inputs than any previous FPGA-based MPC implementation to date, yet the implementation comfortably fits into a midrange FPGA, and the controller compares well in terms of solution quality and latency to state-of-the-art QP solvers running on a standard PC. © 1993-2012 IEEE.
Resumo:
In this paper, we describe models and algorithms for detection and tracking of group and individual targets. We develop two novel group dynamical models, within a continuous time setting, that aim to mimic behavioural properties of groups. We also describe two possible ways of modeling interactions between closely using Markov Random Field (MRF) and repulsive forces. These can be combined together with a group structure transition model to create realistic evolving group models. We use a Markov Chain Monte Carlo (MCMC)-Particles Algorithm to perform sequential inference. Computer simulations demonstrate the ability of the algorithm to detect and track targets within groups, as well as infer the correct group structure over time. ©2008 IEEE.