<?xml version="1.0" encoding="UTF-8"?>
<!DOCTYPE article PUBLIC "-//NLM//DTD Journal Publishing DTD v2.3 20070202//EN" "journalpublishing.dtd">
<article xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink" xml:lang="en" article-type="research-article">
<front>
<journal-meta>
<journal-id journal-id-type="nlm-ta">Sensors</journal-id>
<journal-title>Sensors</journal-title>
<issn pub-type="epub">1424-8220</issn>
<publisher>
<publisher-name>Molecular Diversity Preservation International (MDPI)</publisher-name></publisher></journal-meta>
<article-meta>
<article-id pub-id-type="doi">10.3390/s120911870</article-id>
<article-id pub-id-type="publisher-id">sensors-12-11870</article-id>
<article-categories>
<subj-group>
<subject>Article</subject></subj-group></article-categories>
<title-group>
<article-title>Laser-Based Trespassing Prediction in Restrictive Environments: A Linear Approach</article-title></title-group>
<contrib-group>
<contrib contrib-type="author">
<name><surname>Cheein</surname><given-names>Fernando Auat</given-names></name><xref ref-type="aff" rid="af1-sensors-12-11870"><sup>1</sup></xref><xref ref-type="corresp" rid="c1-sensors-12-11870"><sup>*</sup></xref></contrib>
<contrib contrib-type="author">
<name><surname>Scaglia</surname><given-names>Gustavo</given-names></name><xref ref-type="aff" rid="af2-sensors-12-11870"><sup>2</sup></xref></contrib></contrib-group>
<aff id="af1-sensors-12-11870">
<label>1</label> Department of Electronics Engineering, Federico Santa Maria Technical University, Av Espana 1680, Valparaiso, Chile</aff>
<aff id="af2-sensors-12-11870">
<label>2</label> Chemistry Institute, San Juan National University, Av. San Martin 1109, San Juan, Argentina; E-Mail: <email>gscaglia@unsj.edu.ar</email></aff>
<author-notes>
<corresp id="c1-sensors-12-11870">
<label>*</label>Author to whom correspondence should be addressed; E-Mail: <email>fernando.auat@usm.cl</email>; Tel.: +56-322-652-617; Fax: +56-322-797-469.</corresp></author-notes>
<pub-date pub-type="collection">
<year>2012</year></pub-date>
<pub-date pub-type="epub">
<day>29</day>
<month>08</month>
<year>2012</year></pub-date>
<volume>12</volume>
<issue>9</issue>
<fpage>11870</fpage>
<lpage>11887</lpage>
<history>
<date date-type="received">
<day>25</day>
<month>05</month>
<year>2012</year></date>
<date date-type="rev-recd">
<day>17</day>
<month>07</month>
<year>2012</year></date>
<date date-type="accepted">
<day>30</day>
<month>07</month>
<year>2012</year></date></history>
<permissions>
<copyright-statement>© 2012 by the authors; licensee MDPI, Basel, Switzerland.</copyright-statement>
<copyright-year>2012</copyright-year>
<license>
<p>This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution license (http://creativecommons.org/licenses/by/3.0/).</p></license></permissions>
<abstract>
<p>Stationary range laser sensors for intruder monitoring, restricted space violation detections and workspace determination are extensively used in risky environments. In this work we present a linear based approach for predicting the presence of moving agents before they trespass a laser-based restricted space. Our approach is based on the Taylor's series expansion of the detected objects' movements. The latter makes our proposal suitable for embedded applications. In the experimental results (carried out in different scenarios) presented herein, our proposal shows 100% of effectiveness in predicting trespassing situations. Several implementation results and statistics analysis showing the performance of our proposal are included in this work.</p></abstract>
<kwd-group>
<kwd>target tracking</kwd>
<kwd>linear prediction</kwd>
<kwd>range laser sensor</kwd></kwd-group></article-meta></front>
<body>
<sec sec-type="intro">
<label>1.</label>
<title>Introduction</title>
<p>The tracking and prediction of objects or targets has several applications, such as traffic surveillance [<xref ref-type="bibr" rid="b1-sensors-12-11870">1</xref>], pedestrian detection [<xref ref-type="bibr" rid="b1-sensors-12-11870">1</xref>,<xref ref-type="bibr" rid="b2-sensors-12-11870">2</xref>], mobile robot autonomous navigation in dynamic environments [<xref ref-type="bibr" rid="b3-sensors-12-11870">3</xref>,<xref ref-type="bibr" rid="b4-sensors-12-11870">4</xref>], intelligent transportation systems [<xref ref-type="bibr" rid="b2-sensors-12-11870">2</xref>,<xref ref-type="bibr" rid="b5-sensors-12-11870">5</xref>], among others. Several of these applications require 2D and 3D target tracking, depending mainly on the number of degrees of freedom to be tracked by the system. Also, according to the application, the system can be focused on single and multiple targets tracking.</p>
<p>In general, a target tracking process can be divided into two main stages: <italic>targets' detection</italic> and <italic>tracking procedure</italic> [<xref ref-type="bibr" rid="b6-sensors-12-11870">6</xref>]. The <italic>targets' detection</italic> stage is strongly related to the nature of the sensor used according to the application requirements. A wide range of sensors are currently used in objects or target tracking, such as artificial vision sensors and range laser sensors. With this insight, [<xref ref-type="bibr" rid="b7-sensors-12-11870">7</xref>] uses a stereoscopic camera for visual tracking of 3D objects; [<xref ref-type="bibr" rid="b8-sensors-12-11870">8</xref>] uses a video sequence for single object tracking, whereas [<xref ref-type="bibr" rid="b9-sensors-12-11870">9</xref>] uses a monocular vision system for rigid single object tracking; also, [<xref ref-type="bibr" rid="b10-sensors-12-11870">10</xref>] presents a monocular vision system for object tracking of moving objects, although the authors implement their system on a mobile robot for following purposes. In [<xref ref-type="bibr" rid="b6-sensors-12-11870">6</xref>], the authors use video frames for multiple objects tracking, whereas [<xref ref-type="bibr" rid="b11-sensors-12-11870">11</xref>] also uses video frames but for single object tracking.</p>
<p>Several procedures are used for object detection in artificial vision based applications. In [<xref ref-type="bibr" rid="b7-sensors-12-11870">7</xref>], the authors use the FFT (Fast Fourier Transform) of the image to detect a dark object over a white background; a similar approach is presented in [<xref ref-type="bibr" rid="b1-sensors-12-11870">1</xref>], where the Fourier transform is used to extract features from a video sequence for surveillance applications. In [<xref ref-type="bibr" rid="b12-sensors-12-11870">12</xref>], the authors use frame differentiation and adaptive background subtraction combined with simple data association techniques to extract features. For multi-object tracking, [<xref ref-type="bibr" rid="b6-sensors-12-11870">6</xref>] uses a spatio-temporal segmentation for features extraction from images. In [<xref ref-type="bibr" rid="b13-sensors-12-11870">13</xref>] the authors present an online EM-algorithm for visual estimation of objects' parameters. The former are examples of objects' tracking and detection using artificial vision systems.</p>
<p>Range laser sensors are also used for target tracking applications, such as the case shown in [<xref ref-type="bibr" rid="b14-sensors-12-11870">14</xref>], where a range laser sensor is used for environment modeling when applying a SLAM (Simultaneous Localization and Mapping) algorithm. A SLAM algorithm is used in mobile robot applications [<xref ref-type="bibr" rid="b3-sensors-12-11870">3</xref>,<xref ref-type="bibr" rid="b4-sensors-12-11870">4</xref>,<xref ref-type="bibr" rid="b15-sensors-12-11870">15</xref>–<xref ref-type="bibr" rid="b18-sensors-12-11870">18</xref>] to concurrently estimate the robot's position within an environment and to build a model of such an environment. The latter is accomplished by using exteroceptive sensors, such as range lasers, vision systems, ultrasonic sensors, <italic>etc.</italic> The model built of the environment usually contains the static and dynamic—or moving—elements. Such moving elements are tracked using the same estimation algorithm implemented for the SLAM execution—such as a Kalman Filter, and Information Filter, a Particle Filter, and their respective extensions (see [<xref ref-type="bibr" rid="b16-sensors-12-11870">16</xref>,<xref ref-type="bibr" rid="b19-sensors-12-11870">19</xref>–<xref ref-type="bibr" rid="b21-sensors-12-11870">21</xref>] for further information). The object detection is related to the model of the environment. Thus, in [<xref ref-type="bibr" rid="b3-sensors-12-11870">3</xref>,<xref ref-type="bibr" rid="b4-sensors-12-11870">4</xref>], lines and corners are used for objects determination.</p>
<p>In addition, range laser sensors are also used for intruders detection, trespassing situations and workspace determination, as pointed out by the manufacturers [<xref ref-type="bibr" rid="b22-sensors-12-11870">22</xref>,<xref ref-type="bibr" rid="b23-sensors-12-11870">23</xref>]. However, it is worth mentioning that such applications are static: the workspace and the sensors' positions remain unchanged during the implementation and execution of the system. The intruders detection is based on a threshold determination: if the intruder trespass the protected workspace, a previously determined action is performed, regardless the intention of the intruder. Such an application is usually used in surveillance systems and workspace protection in factories [<xref ref-type="bibr" rid="b23-sensors-12-11870">23</xref>].</p>
<p>Despite the detection algorithm and the sensor used by the system, the <italic>tracking procedure</italic> problem can be solved by several approaches (in this work, we consider the prediction problem as an extension of the tracking problem <italic>per se</italic>). Thus, [<xref ref-type="bibr" rid="b24-sensors-12-11870">24</xref>] uses neural networks for multiple object tracking; [<xref ref-type="bibr" rid="b9-sensors-12-11870">9</xref>] uses a Kalman Filter for real time tracking; [<xref ref-type="bibr" rid="b11-sensors-12-11870">11</xref>] uses an adaptive block matching for the estimation of single object's motion. In [<xref ref-type="bibr" rid="b25-sensors-12-11870">25</xref>], the authors propose a passive monitoring system based on a Gaussian model of the motion of the object; [<xref ref-type="bibr" rid="b2-sensors-12-11870">2</xref>] uses the Bhattacharyya coefficient for visual tracking and [<xref ref-type="bibr" rid="b26-sensors-12-11870">26</xref>] uses the Particle Filter as a tracking algorithm. However, [<xref ref-type="bibr" rid="b27-sensors-12-11870">27</xref>] uses a star algorithm for visual tracking. Considering that prediction is possible by means of an appropriate tracking strategy, several approaches can be found with this scope. Thus, in [<xref ref-type="bibr" rid="b28-sensors-12-11870">28</xref>] the authors propose a tracking and predicting approach based on the <italic>AdaBoost</italic> algorithm for multiple pedestrian scenarios; in [<xref ref-type="bibr" rid="b29-sensors-12-11870">29</xref>], the authors present a particle filtering approach for predicting car's motion. On the other hand, [<xref ref-type="bibr" rid="b30-sensors-12-11870">30</xref>] presents the tracking performed by the Extended Kalman Filter for predicting mobile robot's motion. As can be seen, several approaches can be used to solve the tracking and prediction problem, such as empirical procedures, user dependent decisions and estimation algorithms.</p>
<p>The Taylor's series expansion is also used as a tool for the object tracking and prediction problem. In [<xref ref-type="bibr" rid="b2-sensors-12-11870">2</xref>] the Taylor's expansion is used to obtain a linear model of the Bhattacharyya coefficient used in the prediction procedure; [<xref ref-type="bibr" rid="b9-sensors-12-11870">9</xref>] uses the Taylor's expansion for linearization of the motion model in the Kalman Filter. In [<xref ref-type="bibr" rid="b13-sensors-12-11870">13</xref>], the Taylor's series expansion is used for the linearization of the objective function of the optical flow used in the target tracking application. As can be seen, the Taylor's series expansion is used for linearization purposes of intermediate process within the main tracking procedure. A more extended introduction and state of the art in target tracking procedures can be found in [<xref ref-type="bibr" rid="b31-sensors-12-11870">31</xref>–<xref ref-type="bibr" rid="b34-sensors-12-11870">34</xref>].</p>
<p>The main contribution of this work is a workspace supervision application based on the prediction of trespassing situations by using multiple stationary range laser sensors. The last is accomplished by using the Taylor's series expansion of the motion of the detected targets as a tracking—and predicting— procedure <italic>per se</italic>. Despite the fact that our method is implemented using range laser sensors, the Taylor's series expansion as a tracking procedure proposed in this work is independent of the nature of the sensor. In addition, the Taylor's series expansion as a tracking procedure allows us to predict the trespassing risks before they occur. We have also implemented our proposal for multi-targets prediction. For each proposed situation—single laser with single target, multiple lasers with single target, single laser with multiple targets and multiple lasers with multiple targets—we have performed real time experimentation and statistical analysis showing the advantages of our proposal.</p>
<p>This work is organized as follows: Section 2 shows an overview of the proposed system, the sensors description, the problem's hypothesis and the mathematical formulation of the proposal; Section 3 shows the experimentation and statistical results of each proposed situation. Section 4 presents the pros and cons observed during the experimentation stage. Section 5 shows the conclusions of this work.</p></sec>
<sec>
<label>2.</label>
<title>General System Architecture</title>
<p><xref ref-type="fig" rid="f1-sensors-12-11870">Figure 1</xref> shows the general system architecture of the proposed supervision system. It is composed by four stages explained as following:
<list list-type="bullet">
<list-item>
<p><italic>Sensor Measurement Acquisition</italic>. Concerns the sensor functionality and the environment information acquisition. In this work, we use range laser sensors to acquire the information of the surrounding environment.</p></list-item>
<list-item>
<p><italic>Moving Objects Detection</italic>. The environmental information acquired by the sensors is used to detect the presence of objects—e.g., persons, animals, vehicles, <italic>etc.</italic>—within the sensed workspace.</p></list-item>
<list-item>
<p><italic>Action Execution</italic>. If the detected moving object falls within the restricted region of the workspace, then the system generates the appropriate action, depending on the task in which the supervision system is applied—for example, alarm activation, machinery emergency stop, <italic>etc.</italic></p></list-item></list></p>
<p>The abovementioned three stages form a standard supervision system [<xref ref-type="bibr" rid="b31-sensors-12-11870">31</xref>]. In our work, we include an extra stage: <italic>Objects Tracking and Prediction</italic>. Thus, in case where an object is detected within the sensed workspace, this extra stage will allow for the prediction of the movement of such an object. With the prediction information available, the system is able to execute the appropriate action before the object enters the forbidden—or restricted—workspace, protecting in that way both the object's integrity and the functionality of the <italic>main process</italic>.</p>
<p>It is worth mentioning that such a prediction of the object's movements can be used for the optimization of the sensed workspace by reducing its restricted region. Since the action execution is based on the prediction information, if the predicted object's movements do not compromise the process nor its integrity, then there is no need of an action execution. Nevertheless, the last statement is strongly related to the adopted horizon of prediction. <xref ref-type="fig" rid="f2-sensors-12-11870">Figure 2</xref> shows an example of this situation. <xref ref-type="fig" rid="f2-sensors-12-11870">Figure 2(a)</xref> shows the case when the predicted movement (solid red arrow) enters the restricted region of the workspace (solid grey), whereas <xref ref-type="fig" rid="f2-sensors-12-11870">Figure 2(b)</xref> shows the case when the predicted object's movements do not trespass the forbidden workspace. In both cases, a range laser sensor was used to depict the examples.</p>
<p>In the following sections, each stage of <xref ref-type="fig" rid="f1-sensors-12-11870">Figure 1</xref> will be explained in detail. However, as stated in Section 1, this work is focused on the <italic>Objects Tracking and Prediction</italic> stage.</p>
<sec>
<label>2.1.</label>
<title>Sensor Measurement Acquisition</title>
<p>In this work, <italic>SICK</italic> range laser sensors were used, as the one shown in <xref ref-type="fig" rid="f3-sensors-12-11870">Figure 3</xref>. Such sensors acquire 181 range measurements from 0 to 180 degrees up to a range of 30 meters. As will be shown later, several of these sensors were used during the experimentation. Although in this work range laser measurements are processed, the mathematical formulation of our proposal is not restricted to the nature of the sensor used. Therefore, other sensors such as artificial vision systems, ultrasonic sensors or TOF cameras can be used instead.</p></sec>
<sec>
<label>2.2.</label>
<title>Restricted Region Determination</title>
<p>The restricted workspace determination, as shown in <xref ref-type="fig" rid="f2-sensors-12-11870">Figure 2</xref>, is based on the supervision application. <xref ref-type="fig" rid="f4-sensors-12-11870">Figure 4</xref> shows three different cases; <xref ref-type="fig" rid="f4-sensors-12-11870">Figure 4(a)</xref> shows the case where a symmetric restricted region is used (solid dark grey). Such a case can be useful in approaching alert situations. <xref ref-type="fig" rid="f4-sensors-12-11870">Figure 4(b)</xref> shows an asymmetric restricted region (also in solid dark grey); such a situation is useful when a non-conventional region of the workspace needs to be supervised. On the other hand, <xref ref-type="fig" rid="f4-sensors-12-11870">Figure 4(c)</xref> shows the case of a restricted workspace suitable for robot manipulator implementations, as the one shown in [<xref ref-type="bibr" rid="b35-sensors-12-11870">35</xref>]. It is worth mentioning that the restricted workspace determination is a designer criterion. In addition, two or more laser sensors can be used for defining the restricted workspace, as will be shown in Section 3.</p></sec>
<sec>
<label>2.3.</label>
<title>Object Detection</title>
<p>In this work, the detection of moving objects within the sensed workspace shown in <xref ref-type="fig" rid="f2-sensors-12-11870">Figures 2</xref> and <xref ref-type="fig" rid="f4-sensors-12-11870">4</xref> is based on point-based features detection previously presented in [<xref ref-type="bibr" rid="b3-sensors-12-11870">3</xref>,<xref ref-type="bibr" rid="b4-sensors-12-11870">4</xref>]. Briefly, such a method can be described as follows:
<list list-type="bullet">
<list-item>
<p>From the set of 181 measurements acquired by the range laser sensor, the histogram method [<xref ref-type="bibr" rid="b15-sensors-12-11870">15</xref>] is used to determine possible point-based features and their corresponding covariance matrices.</p></list-item>
<list-item>
<p>If two or more consecutive measurements are associated to a same point-based feature, then its <italic>center of mass</italic> is determined.</p></list-item>
<list-item>
<p>Each <italic>center of mass</italic> of the detected features is composed by three parameters: its range, angle and covariance matrix. The range is the distance from the <italic>center of mass</italic> to the laser position; the angle is the orientation of the <italic>center of mass</italic> with respect to the orientation of the laser; the covariance matrix is the variance associated with the detection method.</p></list-item>
<list-item>
<p>The parameters of each detected feature are transformed according to a global Cartesian reference frame attached to the system (<italic>x<sub>i</sub></italic> and <italic>y<sub>i</sub></italic>, where <italic>i</italic> stands for the <italic>i<sup>th</sup></italic> detected feature).</p></list-item>
<list-item>
<p>If the same object is detected in two consecutive laser scans, then we are able to track it. In order to do so, a matching criterion must be adopted; <italic>i.e.</italic>, the object detected in time <italic>t</italic> + 1 should be the same than the one detected in time <italic>t</italic>. The Mahalanobis distance [<xref ref-type="bibr" rid="b16-sensors-12-11870">16</xref>] was used in this work to match detected features.</p></list-item></list></p>
<p>It is worth mentioning that the object detection method mentioned above allows for the detection of multiple objects. Further information regarding such a method can be found in [<xref ref-type="bibr" rid="b3-sensors-12-11870">3</xref>,<xref ref-type="bibr" rid="b4-sensors-12-11870">4</xref>].</p></sec>
<sec>
<label>2.4.</label>
<title>Prediction and Tracking: Mathematical Formulation</title>
<p>The linear prediction formulation proposed in this work is based on the Taylor's series expansion [<xref ref-type="bibr" rid="b2-sensors-12-11870">2</xref>,<xref ref-type="bibr" rid="b9-sensors-12-11870">9</xref>]. By using the Taylor's series, we are able to predict the motion associated with the detected moving obstacles in the workspace of the sensor. In order to illustrate our proposal, let us suppose the following: let <italic>x</italic>(<italic>t</italic>) be the instantaneous position of a body moving along the <italic>x</italic> coordinate in <xref rid="FD1" ref-type="disp-formula">Equation (1)</xref> (with constant acceleration). Thus,
<disp-formula id="FD1">
<label>(1)</label>
<mml:math id="mm1" display="block">
<mml:semantics id="sm1">
<mml:mrow>
<mml:mi>x</mml:mi>
<mml:mo stretchy="false">(</mml:mo>
<mml:mi>t</mml:mi>
<mml:mo stretchy="false">)</mml:mo>
<mml:mo>=</mml:mo>
<mml:mi>x</mml:mi>
<mml:mo stretchy="false">(</mml:mo>
<mml:msub>
<mml:mi>t</mml:mi>
<mml:mn>0</mml:mn></mml:msub>
<mml:mo stretchy="false">)</mml:mo>
<mml:mo>+</mml:mo>
<mml:mi>v</mml:mi>
<mml:mo stretchy="false">(</mml:mo>
<mml:msub>
<mml:mi>t</mml:mi>
<mml:mn>0</mml:mn></mml:msub>
<mml:mo stretchy="false">)</mml:mo>
<mml:mo stretchy="false">(</mml:mo>
<mml:mi>t</mml:mi>
<mml:mo>−</mml:mo>
<mml:msub>
<mml:mi>t</mml:mi>
<mml:mn>0</mml:mn></mml:msub>
<mml:mo stretchy="false">)</mml:mo>
<mml:mo>+</mml:mo>
<mml:mfrac>
<mml:mrow>
<mml:mi>a</mml:mi>
<mml:mo stretchy="false">(</mml:mo>
<mml:msub>
<mml:mi>t</mml:mi>
<mml:mn>0</mml:mn></mml:msub>
<mml:mo stretchy="false">)</mml:mo>
<mml:msup>
<mml:mrow>
<mml:mo stretchy="false">(</mml:mo>
<mml:mi>t</mml:mi>
<mml:mo>−</mml:mo>
<mml:msub>
<mml:mi>t</mml:mi>
<mml:mn>0</mml:mn></mml:msub>
<mml:mo stretchy="false">)</mml:mo></mml:mrow>
<mml:mn>2</mml:mn></mml:msup></mml:mrow>
<mml:mrow>
<mml:mn>2</mml:mn>
<mml:mo>!</mml:mo></mml:mrow></mml:mfrac></mml:mrow></mml:semantics></mml:math></disp-formula>where <italic>t</italic> represents time, <italic>t</italic><sub>0</sub> is the initial instant, <italic>x</italic>(<italic>t</italic><sub>0</sub>) is the body's initial position, <italic>v</italic>(<italic>t</italic><sub>0</sub>) is its velocity and <italic>a</italic>(<italic>t</italic><sub>0</sub>) is its acceleration. The Taylor's expansion of <italic>x</italic>(<italic>t</italic>) is of the form shown in <xref rid="FD2" ref-type="disp-formula">Equation (2)</xref>.</p>
<disp-formula id="FD2">
<label>(2)</label>
<mml:math id="mm2" display="block">
<mml:semantics id="sm2">
<mml:mrow>
<mml:mi>x</mml:mi>
<mml:mo stretchy="false">(</mml:mo>
<mml:mi>t</mml:mi>
<mml:mo stretchy="false">)</mml:mo>
<mml:mo>=</mml:mo>
<mml:mi>x</mml:mi>
<mml:mo stretchy="false">(</mml:mo>
<mml:msub>
<mml:mi>t</mml:mi>
<mml:mn>0</mml:mn></mml:msub>
<mml:mo stretchy="false">)</mml:mo>
<mml:mo>+</mml:mo>
<mml:mfrac>
<mml:mrow>
<mml:mi>d</mml:mi>
<mml:mi>x</mml:mi>
<mml:mo stretchy="false">(</mml:mo>
<mml:msub>
<mml:mi>t</mml:mi>
<mml:mn>0</mml:mn></mml:msub>
<mml:mo stretchy="false">)</mml:mo></mml:mrow>
<mml:mrow>
<mml:mi>d</mml:mi>
<mml:mi>t</mml:mi></mml:mrow></mml:mfrac>
<mml:mo stretchy="false">(</mml:mo>
<mml:mi>t</mml:mi>
<mml:mo>−</mml:mo>
<mml:msub>
<mml:mi>t</mml:mi>
<mml:mn>0</mml:mn></mml:msub>
<mml:mo stretchy="false">)</mml:mo>
<mml:mo>+</mml:mo>
<mml:mfrac>
<mml:mn>1</mml:mn>
<mml:mrow>
<mml:mn>2</mml:mn>
<mml:mo>!</mml:mo></mml:mrow></mml:mfrac>
<mml:mfrac>
<mml:mrow>
<mml:msup>
<mml:mi>d</mml:mi>
<mml:mn>2</mml:mn></mml:msup>
<mml:mi>x</mml:mi>
<mml:mo stretchy="false">(</mml:mo>
<mml:msub>
<mml:mi>t</mml:mi>
<mml:mn>0</mml:mn></mml:msub>
<mml:mo stretchy="false">)</mml:mo></mml:mrow>
<mml:mrow>
<mml:mi>d</mml:mi>
<mml:msup>
<mml:mi>t</mml:mi>
<mml:mn>2</mml:mn></mml:msup></mml:mrow></mml:mfrac>
<mml:msup>
<mml:mrow>
<mml:mo stretchy="false">(</mml:mo>
<mml:mi>t</mml:mi>
<mml:mo>−</mml:mo>
<mml:msub>
<mml:mi>t</mml:mi>
<mml:mn>0</mml:mn></mml:msub>
<mml:mo stretchy="false">)</mml:mo></mml:mrow>
<mml:mn>2</mml:mn></mml:msup>
<mml:mo>+</mml:mo>
<mml:msub>
<mml:mi>R</mml:mi>
<mml:mi>m</mml:mi></mml:msub></mml:mrow></mml:semantics></mml:math></disp-formula>
<p>In <xref rid="FD2" ref-type="disp-formula">Equation (2)</xref>, <italic>R<sub>m</sub></italic> is a residual term which contains the higher order values regarding the Taylor's expansion of <italic>x</italic>(<italic>t</italic>). If we compare <xref rid="FD1" ref-type="disp-formula">Equation (1)</xref> to <xref rid="FD2" ref-type="disp-formula">Equation (2)</xref>, we can see that both expressions match and that we can use the Taylor's expansion to estimate the motion of a given object by discarding <italic>R<sub>m</sub></italic>. In fact, the horizon of our estimation is associated with <italic>R<sub>m</sub></italic> due to the following:
<list list-type="bullet">
<list-item>
<p>In order to estimate <italic>x</italic>(<italic>t</italic>) by using the Taylor's series expansion shown in <xref rid="FD2" ref-type="disp-formula">Equation (2)</xref>, then <italic>x</italic>(.) belongs at least to <italic>C</italic><sup>2</sup>, where <italic>C</italic><sup>2</sup> is the space of continuous functions with first and second differential also continuous.</p></list-item>
<list-item>
<p>If <italic>x</italic>(.) ∈ <italic>C</italic><sup>3</sup>, then <xref rid="FD2" ref-type="disp-formula">Equation (2)</xref> may include a term from <italic>R<sub>m</sub></italic> associated with the third differential of <italic>x</italic>(<italic>t</italic>). Thus, the horizon of prediction is increased.</p></list-item>
<list-item>
<p>In general, if <italic>x</italic>(.) ∈ <italic>C<sup>n</sup></italic>, then the Taylor's expansion of <italic>x</italic>(<italic>t</italic>) can be up to its <italic>n<sup>th</sup></italic>–differential term.</p></list-item></list></p>
<p>In addition, if we consider the Euler approximation: 
<inline-formula>
<mml:math id="mm3" display="inline">
<mml:semantics id="sm3">
<mml:mrow>
<mml:mfrac>
<mml:mrow>
<mml:mi>d</mml:mi>
<mml:mi>x</mml:mi>
<mml:mo stretchy="false">(</mml:mo>
<mml:mi>t</mml:mi>
<mml:mo stretchy="false">)</mml:mo></mml:mrow>
<mml:mrow>
<mml:mi>d</mml:mi>
<mml:mi>t</mml:mi></mml:mrow></mml:mfrac>
<mml:mo>≈</mml:mo>
<mml:mfrac>
<mml:mrow>
<mml:mi>x</mml:mi>
<mml:mo stretchy="false">(</mml:mo>
<mml:msub>
<mml:mi>t</mml:mi>
<mml:mi>x</mml:mi></mml:msub>
<mml:mo stretchy="false">)</mml:mo>
<mml:mo>−</mml:mo>
<mml:mi>x</mml:mi>
<mml:mo stretchy="false">(</mml:mo>
<mml:msub>
<mml:mi>t</mml:mi>
<mml:mrow>
<mml:mi>k</mml:mi>
<mml:mo>−</mml:mo>
<mml:mn>1</mml:mn></mml:mrow></mml:msub>
<mml:mo stretchy="false">)</mml:mo></mml:mrow>
<mml:mrow>
<mml:msub>
<mml:mi>t</mml:mi>
<mml:mi>x</mml:mi></mml:msub>
<mml:mo>−</mml:mo>
<mml:msub>
<mml:mi>t</mml:mi>
<mml:mrow>
<mml:mi>k</mml:mi>
<mml:mo>−</mml:mo>
<mml:mn>1</mml:mn></mml:mrow></mml:msub></mml:mrow></mml:mfrac></mml:mrow></mml:semantics></mml:math></inline-formula> for Δ<sub><italic>t</italic></sub> = <italic>t<sub>k</sub></italic> − <italic>t</italic><sub><italic>k</italic>−1</sub> sufficiently small, we can apply such an approximation to <xref rid="FD2" ref-type="disp-formula">Equation (2)</xref> as shown below. Thus, for <italic>x</italic>(.) ∈ <italic>C</italic><sup>0</sup>:
<disp-formula id="FD3">
<label>(3)</label>
<mml:math id="mm4" display="block">
<mml:semantics id="sm4">
<mml:mrow>
<mml:mi>x</mml:mi>
<mml:mo stretchy="false">(</mml:mo>
<mml:msub>
<mml:mi>t</mml:mi>
<mml:mrow>
<mml:mi>k</mml:mi>
<mml:mo>+</mml:mo>
<mml:mn>1</mml:mn></mml:mrow></mml:msub>
<mml:mo stretchy="false">)</mml:mo>
<mml:mo>≈</mml:mo>
<mml:mi>x</mml:mi>
<mml:mo stretchy="false">(</mml:mo>
<mml:msub>
<mml:mi>t</mml:mi>
<mml:mi>k</mml:mi></mml:msub>
<mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:semantics></mml:math></disp-formula></p>
<p>With the same insight, for <italic>x</italic>(.) ∈ <italic>C</italic><sup>1</sup>:
<disp-formula id="FD4">
<label>(4)</label>
<mml:math id="mm5" display="block">
<mml:semantics id="sm5">
<mml:mrow>
<mml:mi>x</mml:mi>
<mml:mo stretchy="false">(</mml:mo>
<mml:msub>
<mml:mi>t</mml:mi>
<mml:mrow>
<mml:mi>k</mml:mi>
<mml:mo>+</mml:mo>
<mml:mn>1</mml:mn></mml:mrow></mml:msub>
<mml:mo stretchy="false">)</mml:mo>
<mml:mo>≈</mml:mo>
<mml:mi>x</mml:mi>
<mml:mo stretchy="false">(</mml:mo>
<mml:msub>
<mml:mi>t</mml:mi>
<mml:mi>k</mml:mi></mml:msub>
<mml:mo stretchy="false">)</mml:mo>
<mml:mo>+</mml:mo>
<mml:mfrac>
<mml:mrow>
<mml:mi>x</mml:mi>
<mml:mo stretchy="false">(</mml:mo>
<mml:msub>
<mml:mi>t</mml:mi>
<mml:mi>k</mml:mi></mml:msub>
<mml:mo stretchy="false">)</mml:mo>
<mml:mo>−</mml:mo>
<mml:mi>x</mml:mi>
<mml:mo stretchy="false">(</mml:mo>
<mml:msub>
<mml:mi>t</mml:mi>
<mml:mrow>
<mml:mi>k</mml:mi>
<mml:mo>−</mml:mo>
<mml:mn>1</mml:mn></mml:mrow></mml:msub>
<mml:mo stretchy="false">)</mml:mo></mml:mrow>
<mml:mrow>
<mml:msub>
<mml:mi>t</mml:mi>
<mml:mi>k</mml:mi></mml:msub>
<mml:mo>−</mml:mo>
<mml:msub>
<mml:mi>t</mml:mi>
<mml:mrow>
<mml:msub>
<mml:mi>k</mml:mi>
<mml:mn>1</mml:mn></mml:msub></mml:mrow></mml:msub></mml:mrow></mml:mfrac>
<mml:mo stretchy="false">(</mml:mo>
<mml:msub>
<mml:mi>t</mml:mi>
<mml:mi>k</mml:mi></mml:msub>
<mml:mo>−</mml:mo>
<mml:msub>
<mml:mi>t</mml:mi>
<mml:mrow>
<mml:msub>
<mml:mi>k</mml:mi>
<mml:mn>1</mml:mn></mml:msub></mml:mrow></mml:msub>
<mml:mo stretchy="false">)</mml:mo>
<mml:mo>=</mml:mo>
<mml:mn>2</mml:mn>
<mml:mi>x</mml:mi>
<mml:mo stretchy="false">(</mml:mo>
<mml:msub>
<mml:mi>t</mml:mi>
<mml:mi>x</mml:mi></mml:msub>
<mml:mo stretchy="false">)</mml:mo>
<mml:mo>−</mml:mo>
<mml:mi>x</mml:mi>
<mml:mo stretchy="false">(</mml:mo>
<mml:msub>
<mml:mi>t</mml:mi>
<mml:mrow>
<mml:mi>k</mml:mi>
<mml:mo>−</mml:mo>
<mml:mn>1</mml:mn></mml:mrow></mml:msub>
<mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:semantics></mml:math></disp-formula></p>
<p>In addition, for <italic>x</italic>(.) ∈ <italic>C</italic><sup>2</sup> and considering that Δ<italic><sub>t</sub></italic> = <italic>t<sub>i</sub></italic> − <italic>t</italic><sub><italic>i</italic>−1</sub> for <italic>i</italic> = 0‥<italic>k</italic> + 1:
<disp-formula id="FD5">
<label>(5)</label>
<mml:math id="mm6" display="block">
<mml:semantics id="sm6">
<mml:mrow>
<mml:mi>x</mml:mi>
<mml:mo stretchy="false">(</mml:mo>
<mml:msub>
<mml:mi>t</mml:mi>
<mml:mrow>
<mml:mi>k</mml:mi>
<mml:mo>+</mml:mo>
<mml:mn>1</mml:mn></mml:mrow></mml:msub>
<mml:mo stretchy="false">)</mml:mo>
<mml:mo>≈</mml:mo>
<mml:mi>x</mml:mi>
<mml:mo stretchy="false">(</mml:mo>
<mml:msub>
<mml:mi>t</mml:mi>
<mml:mi>x</mml:mi></mml:msub>
<mml:mo stretchy="false">)</mml:mo>
<mml:mo>+</mml:mo>
<mml:mfrac>
<mml:mrow>
<mml:mi>x</mml:mi>
<mml:mo stretchy="false">(</mml:mo>
<mml:msub>
<mml:mi>t</mml:mi>
<mml:mi>x</mml:mi></mml:msub>
<mml:mo stretchy="false">)</mml:mo>
<mml:mo>−</mml:mo>
<mml:mi>x</mml:mi>
<mml:mo stretchy="false">(</mml:mo>
<mml:msub>
<mml:mi>t</mml:mi>
<mml:mrow>
<mml:mi>k</mml:mi>
<mml:mo>−</mml:mo>
<mml:mn>1</mml:mn></mml:mrow></mml:msub>
<mml:mo stretchy="false">)</mml:mo></mml:mrow>
<mml:mrow>
<mml:msub>
<mml:mi mathvariant="normal">Δ</mml:mi>
<mml:mi>t</mml:mi></mml:msub></mml:mrow></mml:mfrac>
<mml:mo stretchy="false">(</mml:mo>
<mml:msub>
<mml:mi mathvariant="normal">Δ</mml:mi>
<mml:mi>t</mml:mi></mml:msub>
<mml:mo stretchy="false">)</mml:mo>
<mml:mo>+</mml:mo>
<mml:mfrac>
<mml:mn>1</mml:mn>
<mml:mrow>
<mml:mn>2</mml:mn>
<mml:mo>!</mml:mo></mml:mrow></mml:mfrac>
<mml:mfrac>
<mml:mrow>
<mml:mo stretchy="false">(</mml:mo>
<mml:mi>x</mml:mi>
<mml:mo stretchy="false">(</mml:mo>
<mml:msub>
<mml:mi>t</mml:mi>
<mml:mi>k</mml:mi></mml:msub>
<mml:mo stretchy="false">)</mml:mo>
<mml:mo>−</mml:mo>
<mml:mi>x</mml:mi>
<mml:mo stretchy="false">(</mml:mo>
<mml:msub>
<mml:mi>t</mml:mi>
<mml:mrow>
<mml:mi>k</mml:mi>
<mml:mo>−</mml:mo>
<mml:mn>1</mml:mn></mml:mrow></mml:msub>
<mml:mo stretchy="false">)</mml:mo>
<mml:mo stretchy="false">)</mml:mo>
<mml:mo>−</mml:mo>
<mml:mo stretchy="false">(</mml:mo>
<mml:mi>x</mml:mi>
<mml:mo stretchy="false">(</mml:mo>
<mml:msub>
<mml:mi>t</mml:mi>
<mml:mrow>
<mml:mi>k</mml:mi>
<mml:mo>−</mml:mo>
<mml:mn>1</mml:mn></mml:mrow></mml:msub>
<mml:mo stretchy="false">)</mml:mo>
<mml:mo>−</mml:mo>
<mml:mi>x</mml:mi>
<mml:mo stretchy="false">(</mml:mo>
<mml:msub>
<mml:mi>t</mml:mi>
<mml:mrow>
<mml:mi>k</mml:mi>
<mml:mo>−</mml:mo>
<mml:mn>2</mml:mn></mml:mrow></mml:msub>
<mml:mo stretchy="false">)</mml:mo>
<mml:mo stretchy="false">)</mml:mo></mml:mrow>
<mml:mrow>
<mml:msubsup>
<mml:mi mathvariant="normal">Δ</mml:mi>
<mml:mi>t</mml:mi>
<mml:mn>2</mml:mn></mml:msubsup></mml:mrow></mml:mfrac>
<mml:mo stretchy="false">(</mml:mo>
<mml:msubsup>
<mml:mi mathvariant="normal">Δ</mml:mi>
<mml:mi>t</mml:mi>
<mml:mn>2</mml:mn></mml:msubsup>
<mml:mo stretchy="false">)</mml:mo>
<mml:mo>=</mml:mo>
<mml:mfrac>
<mml:mn>5</mml:mn>
<mml:mn>2</mml:mn></mml:mfrac>
<mml:mi>x</mml:mi>
<mml:mo stretchy="false">(</mml:mo>
<mml:msub>
<mml:mi>t</mml:mi>
<mml:mi>k</mml:mi></mml:msub>
<mml:mo stretchy="false">)</mml:mo>
<mml:mo>−</mml:mo>
<mml:mn>2</mml:mn>
<mml:mi>x</mml:mi>
<mml:mo stretchy="false">(</mml:mo>
<mml:msub>
<mml:mi>t</mml:mi>
<mml:mrow>
<mml:mi>k</mml:mi>
<mml:mo>−</mml:mo>
<mml:mn>1</mml:mn></mml:mrow></mml:msub>
<mml:mo stretchy="false">)</mml:mo>
<mml:mo>+</mml:mo>
<mml:mfrac>
<mml:mrow>
<mml:mi>x</mml:mi>
<mml:mo stretchy="false">(</mml:mo>
<mml:msub>
<mml:mi>t</mml:mi>
<mml:mrow>
<mml:mi>k</mml:mi>
<mml:mo>−</mml:mo>
<mml:mn>2</mml:mn></mml:mrow></mml:msub>
<mml:mo stretchy="false">)</mml:mo></mml:mrow>
<mml:mn>2</mml:mn></mml:mfrac></mml:mrow></mml:semantics></mml:math></disp-formula></p>
<p>Therefore, if the sampling time Δ<italic><sub>t</sub></italic> is constant, we are able to find a prediction of <italic>x</italic>(<italic>t</italic>) for <italic>x</italic>(<italic>t</italic><sub><italic>k</italic>+1</sub>) based on the Taylor's series expansion. The extension of the procedure shown in <xref rid="FD3" ref-type="disp-formula">Equations (3)</xref>–<xref rid="FD5" ref-type="disp-formula">(5)</xref> for <italic>x</italic>(.) ∈ <italic>C<sup>n</sup></italic> is straightforward.</p>
<p>For the multi-dimensional case, let <italic>f</italic>(<italic>t</italic>) be an <italic>b</italic>-dimensional function such that <italic>f</italic>(<italic>t</italic>) ∈ <italic>R<sup>b</sup></italic>—where <italic>R</italic> is the space of the real valued numbers—and that <italic>f</italic>(.) ∈ <italic>C<sup>l</sup></italic>. Thus, the Taylor's series expansion of <italic>f</italic>(<italic>t</italic>) is of the form:
<disp-formula id="FD6">
<label>(6)</label>
<mml:math id="mm7" display="block">
<mml:semantics id="sm7">
<mml:mrow>
<mml:mi>f</mml:mi>
<mml:mo stretchy="false">(</mml:mo>
<mml:mi>t</mml:mi>
<mml:mo stretchy="false">)</mml:mo>
<mml:mo>=</mml:mo>
<mml:munderover>
<mml:mo>∑</mml:mo>
<mml:mrow>
<mml:mi>p</mml:mi>
<mml:mo>=</mml:mo>
<mml:mn>0</mml:mn></mml:mrow>
<mml:mi>l</mml:mi></mml:munderover>
<mml:mrow>
<mml:mfrac>
<mml:mrow>
<mml:msup>
<mml:mi mathvariant="normal">Δ</mml:mi>
<mml:mi>p</mml:mi></mml:msup>
<mml:mo stretchy="false">(</mml:mo>
<mml:mi>f</mml:mi>
<mml:mo stretchy="false">(</mml:mo>
<mml:msub>
<mml:mi>t</mml:mi>
<mml:mi>k</mml:mi></mml:msub>
<mml:mo stretchy="false">)</mml:mo>
<mml:mo stretchy="false">)</mml:mo></mml:mrow>
<mml:mrow>
<mml:mi>p</mml:mi>
<mml:mo>!</mml:mo></mml:mrow></mml:mfrac>
<mml:msup>
<mml:mrow>
<mml:mo stretchy="false">(</mml:mo>
<mml:mi>t</mml:mi>
<mml:mo>−</mml:mo>
<mml:msub>
<mml:mi>t</mml:mi>
<mml:mi>k</mml:mi></mml:msub>
<mml:mo stretchy="false">)</mml:mo></mml:mrow>
<mml:mi>p</mml:mi></mml:msup>
<mml:mo>+</mml:mo>
<mml:msub>
<mml:mi>R</mml:mi>
<mml:mi>m</mml:mi></mml:msub></mml:mrow></mml:mrow></mml:semantics></mml:math></disp-formula></p>
<p>In <xref rid="FD6" ref-type="disp-formula">Equation (6)</xref>, <italic>f</italic> is expanded around <italic>t<sub>k</sub></italic> and Δ<italic><sup>p</sup></italic>(<italic>f</italic>(<italic>t<sub>k</sub></italic>)) is the <italic>p<sup>th</sup></italic> differentiation of <italic>f</italic> with respect to <italic>t</italic> around <italic>t<sub>k</sub></italic>. By applying the procedure shown in <xref rid="FD3" ref-type="disp-formula">Equations (3)</xref>–<xref rid="FD5" ref-type="disp-formula">(5)</xref> and taking into account that Δ<italic>t</italic> = <italic>t<sub>i</sub></italic> − <italic>t</italic><sub><italic>i</italic>−1</sub> for <italic>i</italic> = 1…<italic>k</italic> + 1, we have that, for the three cases (<italic>f</italic>(.) ∈ <italic>C</italic><sup>0</sup>, <italic>f</italic>(.) ∈ <italic>C</italic><sup>1</sup> and <italic>f</italic>(.) ∈ <italic>C</italic><sup>2</sup>):
<disp-formula id="FD7">
<label>(7)</label>
<mml:math id="mm8" display="block">
<mml:semantics id="sm8">
<mml:mrow>
<mml:mrow>
<mml:mo>{</mml:mo>
<mml:mrow>
<mml:mtable columnalign="left">
<mml:mtr columnalign="left">
<mml:mtd columnalign="left">
<mml:mrow>
<mml:mi>f</mml:mi>
<mml:mo stretchy="false">(</mml:mo>
<mml:msub>
<mml:mi>t</mml:mi>
<mml:mrow>
<mml:mi>k</mml:mi>
<mml:mo>+</mml:mo>
<mml:mn>1</mml:mn></mml:mrow></mml:msub>
<mml:mo stretchy="false">)</mml:mo>
<mml:mo>≈</mml:mo>
<mml:mi>f</mml:mi>
<mml:mo stretchy="false">(</mml:mo>
<mml:msub>
<mml:mi>t</mml:mi>
<mml:mi>k</mml:mi></mml:msub>
<mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mtd></mml:mtr>
<mml:mtr columnalign="left">
<mml:mtd columnalign="left">
<mml:mrow>
<mml:mi>f</mml:mi>
<mml:mo stretchy="false">(</mml:mo>
<mml:msub>
<mml:mi>t</mml:mi>
<mml:mrow>
<mml:mi>k</mml:mi>
<mml:mo>+</mml:mo>
<mml:mn>1</mml:mn></mml:mrow></mml:msub>
<mml:mo stretchy="false">)</mml:mo>
<mml:mo>≈</mml:mo>
<mml:mn>2</mml:mn>
<mml:mi>f</mml:mi>
<mml:mo stretchy="false">(</mml:mo>
<mml:msub>
<mml:mi>t</mml:mi>
<mml:mi>k</mml:mi></mml:msub>
<mml:mo stretchy="false">)</mml:mo>
<mml:mo>−</mml:mo>
<mml:mi>f</mml:mi>
<mml:mo stretchy="false">(</mml:mo>
<mml:msub>
<mml:mi>t</mml:mi>
<mml:mrow>
<mml:mi>k</mml:mi>
<mml:mo>−</mml:mo>
<mml:mn>1</mml:mn></mml:mrow></mml:msub>
<mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mtd></mml:mtr>
<mml:mtr columnalign="left">
<mml:mtd columnalign="left">
<mml:mrow>
<mml:mi>f</mml:mi>
<mml:mo stretchy="false">(</mml:mo>
<mml:msub>
<mml:mi>t</mml:mi>
<mml:mrow>
<mml:mi>k</mml:mi>
<mml:mo>+</mml:mo>
<mml:mn>1</mml:mn></mml:mrow></mml:msub>
<mml:mo stretchy="false">)</mml:mo>
<mml:mo>≈</mml:mo>
<mml:mfrac>
<mml:mn>5</mml:mn>
<mml:mn>2</mml:mn></mml:mfrac>
<mml:mi>f</mml:mi>
<mml:mo stretchy="false">(</mml:mo>
<mml:msub>
<mml:mi>t</mml:mi>
<mml:mi>k</mml:mi></mml:msub>
<mml:mo stretchy="false">)</mml:mo>
<mml:mo>−</mml:mo>
<mml:mn>2</mml:mn>
<mml:mi>f</mml:mi>
<mml:mo stretchy="false">(</mml:mo>
<mml:msub>
<mml:mi>t</mml:mi>
<mml:mrow>
<mml:mi>k</mml:mi>
<mml:mo>−</mml:mo>
<mml:mn>1</mml:mn></mml:mrow></mml:msub>
<mml:mo stretchy="false">)</mml:mo>
<mml:mo>+</mml:mo>
<mml:mfrac>
<mml:mrow>
<mml:mi>f</mml:mi>
<mml:mo stretchy="false">(</mml:mo>
<mml:msub>
<mml:mi>t</mml:mi>
<mml:mrow>
<mml:mi>k</mml:mi>
<mml:mo>−</mml:mo>
<mml:mn>2</mml:mn></mml:mrow></mml:msub>
<mml:mo stretchy="false">)</mml:mo></mml:mrow>
<mml:mn>2</mml:mn></mml:mfrac></mml:mrow></mml:mtd></mml:mtr></mml:mtable></mml:mrow></mml:mrow></mml:mrow></mml:semantics></mml:math></disp-formula></p>
<p>Furthermore, for the two-dimensional case (<italic>i.e., f</italic>(<italic>t</italic>) ∈ <italic>R</italic><sup>2</sup>) and taking into account the object detection procedure presented in Section 2.3, let [<italic>x<sub>i,t<sub>k</sub></sub> y<sub>i,t<sub>k</sub></sub></italic>]<italic><sup>T</sup></italic> be the coordinates of the <italic>i<sup>th</sup></italic> detected object at time <italic>t<sub>k</sub></italic>, with respect to a global Cartesian reference frame. Then,
<disp-formula id="FD8">
<label>(8)</label>
<mml:math id="mm9" display="block">
<mml:semantics id="sm9">
<mml:mrow>
<mml:mrow>
<mml:mo>[</mml:mo>
<mml:mrow>
<mml:mtable columnalign="left">
<mml:mtr columnalign="left">
<mml:mtd columnalign="left">
<mml:mrow>
<mml:mi>x</mml:mi>
<mml:mo stretchy="false">(</mml:mo>
<mml:mi>i</mml:mi>
<mml:mo>,</mml:mo>
<mml:msub>
<mml:mi>t</mml:mi>
<mml:mrow>
<mml:mi>k</mml:mi>
<mml:mo>+</mml:mo>
<mml:mn>1</mml:mn></mml:mrow></mml:msub>
<mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mtd></mml:mtr>
<mml:mtr columnalign="left">
<mml:mtd columnalign="left">
<mml:mrow>
<mml:mi>y</mml:mi>
<mml:mo stretchy="false">(</mml:mo>
<mml:mi>i</mml:mi>
<mml:mo>,</mml:mo>
<mml:msub>
<mml:mi>t</mml:mi>
<mml:mrow>
<mml:mi>k</mml:mi>
<mml:mo>+</mml:mo>
<mml:mn>1</mml:mn></mml:mrow></mml:msub>
<mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mtd></mml:mtr></mml:mtable></mml:mrow>
<mml:mo>]</mml:mo></mml:mrow>
<mml:mo>=</mml:mo>
<mml:mfrac>
<mml:mn>5</mml:mn>
<mml:mn>2</mml:mn></mml:mfrac>
<mml:mspace width="0.2em"/>
<mml:mrow>
<mml:mo>[</mml:mo>
<mml:mrow>
<mml:mtable columnalign="left">
<mml:mtr columnalign="left">
<mml:mtd columnalign="left">
<mml:mrow>
<mml:mi>x</mml:mi>
<mml:mo stretchy="false">(</mml:mo>
<mml:mi>i</mml:mi>
<mml:mo>,</mml:mo>
<mml:msub>
<mml:mi>t</mml:mi>
<mml:mi>k</mml:mi></mml:msub>
<mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mtd></mml:mtr>
<mml:mtr columnalign="left">
<mml:mtd columnalign="left">
<mml:mrow>
<mml:mi>y</mml:mi>
<mml:mo stretchy="false">(</mml:mo>
<mml:mi>i</mml:mi>
<mml:mo>,</mml:mo>
<mml:msub>
<mml:mi>t</mml:mi>
<mml:mi>k</mml:mi></mml:msub>
<mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mtd></mml:mtr></mml:mtable></mml:mrow>
<mml:mo>]</mml:mo></mml:mrow>
<mml:mo>−</mml:mo>
<mml:mn>2</mml:mn>
<mml:mspace width="0.2em"/>
<mml:mrow>
<mml:mo>[</mml:mo>
<mml:mrow>
<mml:mtable columnalign="left">
<mml:mtr columnalign="left">
<mml:mtd columnalign="left">
<mml:mrow>
<mml:mi>x</mml:mi>
<mml:mo stretchy="false">(</mml:mo>
<mml:mi>i</mml:mi>
<mml:mo>,</mml:mo>
<mml:msub>
<mml:mi>t</mml:mi>
<mml:mrow>
<mml:mi>k</mml:mi>
<mml:mo>−</mml:mo>
<mml:mn>1</mml:mn></mml:mrow></mml:msub>
<mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mtd></mml:mtr>
<mml:mtr columnalign="left">
<mml:mtd columnalign="left">
<mml:mrow>
<mml:mi>y</mml:mi>
<mml:mo stretchy="false">(</mml:mo>
<mml:mi>i</mml:mi>
<mml:mo>,</mml:mo>
<mml:msub>
<mml:mi>t</mml:mi>
<mml:mrow>
<mml:mi>k</mml:mi>
<mml:mo>−</mml:mo>
<mml:mn>1</mml:mn></mml:mrow></mml:msub>
<mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mtd></mml:mtr></mml:mtable></mml:mrow>
<mml:mo>]</mml:mo></mml:mrow>
<mml:mo>+</mml:mo>
<mml:mfrac>
<mml:mn>1</mml:mn>
<mml:mn>2</mml:mn></mml:mfrac>
<mml:mspace width="0.2em"/>
<mml:mrow>
<mml:mo>[</mml:mo>
<mml:mrow>
<mml:mtable columnalign="left">
<mml:mtr columnalign="left">
<mml:mtd columnalign="left">
<mml:mrow>
<mml:mi>x</mml:mi>
<mml:mo stretchy="false">(</mml:mo>
<mml:mi>i</mml:mi>
<mml:mo>,</mml:mo>
<mml:msub>
<mml:mi>t</mml:mi>
<mml:mrow>
<mml:mi>k</mml:mi>
<mml:mo>−</mml:mo>
<mml:mn>2</mml:mn></mml:mrow></mml:msub>
<mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mtd></mml:mtr>
<mml:mtr columnalign="left">
<mml:mtd columnalign="left">
<mml:mrow>
<mml:mi>y</mml:mi>
<mml:mo stretchy="false">(</mml:mo>
<mml:mi>i</mml:mi>
<mml:mo>,</mml:mo>
<mml:msub>
<mml:mi>t</mml:mi>
<mml:mrow>
<mml:mi>k</mml:mi>
<mml:mo>−</mml:mo>
<mml:mn>2</mml:mn></mml:mrow></mml:msub>
<mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mtd></mml:mtr></mml:mtable></mml:mrow>
<mml:mo>]</mml:mo></mml:mrow>
<mml:mo>+</mml:mo>
<mml:msub>
<mml:mi>R</mml:mi>
<mml:mi>m</mml:mi></mml:msub></mml:mrow></mml:semantics></mml:math></disp-formula>where <italic>R<sub>m</sub></italic> ∈ <italic>R</italic><sup>2</sup>. If we consider that the motion of the detected object falls within <italic>C</italic><sup>2</sup>, then <xref rid="FD8" ref-type="disp-formula">Equation (8)</xref> offers a suitable solution for predicting the motion of the object (<italic>R<sub>m</sub></italic> should be discarded). In addition, given the algebraic formulation of the proposal, such a predictive approach can be implemented embedded in both low cost and high cost micro-controllers.</p>
<p>It is worth mentioning that, if more precision is required, the number of terms in <xref rid="FD8" ref-type="disp-formula">Equation (8)</xref> should be extended (e.g., up to its <italic>n<sup>th</sup></italic> term). <xref rid="FD8" ref-type="disp-formula">Equation (8)</xref> is the one implemented in this work for the motion prediction of the detected objects, because it considers the velocity and the acceleration (associated with the inertia) of the object (see <xref rid="FD1" ref-type="disp-formula">Equation (1)</xref>). In addition, <xref rid="FD8" ref-type="disp-formula">Equation (8)</xref> can be applied to human motion and to mobile robot's motion [<xref ref-type="bibr" rid="b28-sensors-12-11870">28</xref>,<xref ref-type="bibr" rid="b30-sensors-12-11870">30</xref>].</p>
<p>By inspection we can see that, if <italic>f</italic>(.) ∈ <italic>C</italic><sup>2</sup>, then we need the previous knowledge of <italic>f</italic>(<italic>t<sub>k</sub></italic><sub>−1</sub>) and <italic>f</italic>(<italic>t<sub>k</sub></italic><sub>−2</sub>) in order to predict <italic>f</italic>(<italic>t<sub>k</sub></italic><sub>+1</sub>). Therefore, the very first prediction of the process should consider <italic>f</italic>(<italic>t<sub>k</sub></italic><sub>−1</sub>) and <italic>f</italic>(<italic>t<sub>k</sub></italic><sub>−2</sub>) as a previously defined values (e.g., zero). In our implementations, due to the errors associated with the first predictions, we have discarded the first two predictions.</p>
<p>In addition, if an <italic>r</italic> times forward prediction is expected after one object detection (at time <italic>t<sub>k</sub></italic>), then the expression in <xref rid="FD8" ref-type="disp-formula">Equation (8)</xref> can be successively applied to obtain a prediction up to time <italic>t<sub>k</sub></italic><sub>+</sub><italic><sub>r</sub></italic>.</p></sec>
<sec>
<label>2.5.</label>
<title>Action Execution</title>
<p>The action execution, as shown in <xref ref-type="fig" rid="f1-sensors-12-11870">Figure 1</xref>, is a designer criterion and it is strictly related to the supervision application nature. Depending on the application, the following situations might apply:
<list list-type="order">
<list-item>
<p><italic>Surveillance</italic>. For stationary lasers disposition, a supervision application can be used to predict the presence of intruders. In such a case, an alarm activation can be used as an <italic>action</italic> once the intruder's trespass have been predicted.</p></list-item>
<list-item>
<p><italic>Risk management</italic>. The supervision system can be used to detect when a worker is near a dangerous place within the factory—such as automobile assembly lines, in which robot manipulators are in charge of the mechanic work. Thus, for example, once the presence of a worker within the restricted workspace is predicted, the productive process can be stopped until the risk to the worker's integrity is no longer present.</p></list-item>
<list-item>
<p><italic>Vehicles navigation</italic>. For autonomous vehicle navigation, a supervision application can be used for reactive behavior under non-expected situations, such as avoiding obstacles, emergency stops, tangential deviation, among others [<xref ref-type="bibr" rid="b4-sensors-12-11870">4</xref>,<xref ref-type="bibr" rid="b16-sensors-12-11870">16</xref>,<xref ref-type="bibr" rid="b36-sensors-12-11870">36</xref>].</p></list-item></list></p>
<p>Although several actions can be taken into account according to the application requirements, this work is focused on the <italic>Objects Tracking and Prediction</italic> stage, as stated in Section 2.</p></sec></sec>
<sec sec-type="results">
<label>3.</label>
<title>Experimental Results</title>
<p>Several experimental results were carried out in order to show the performance of the proposal. They can be grouped as follows:
<list list-type="bullet">
<list-item>
<p>Single laser with single object prediction.</p></list-item>
<list-item>
<p>Single laser with multiple objects prediction.</p></list-item>
<list-item>
<p>Multiple lasers with single object prediction.</p></list-item>
<list-item>
<p>Multiple lasers with multiple objects prediction.</p></list-item></list></p>
<p>For each mentioned case, 50 trials were run for two different restricted workspace dispositions, see <xref ref-type="fig" rid="f2-sensors-12-11870">Figure 2</xref>. In 25 trials, the intention of the object was to trespass the restricted workspace, whereas in the remaining 25 trials, the intention was the opposite. Up to three persons were considered as moving objects for our supervision application. Each trial consisted of a different path followed by the subjects. In addition, a second order prediction model (see <xref rid="FD8" ref-type="disp-formula">Equation (8)</xref>) was associated with the subjects' motion; <italic>r</italic>, the forward time of prediction, was set to <italic>r</italic> = 10 and <italic>r</italic> = 50 (thus, we are able to predict up to <italic>t<sub>k</sub></italic><sub>+</sub><italic><sub>r</sub></italic>, as previously mentioned). Considering that the sampling time of the system was set to Δ<italic><sub>t</sub></italic> = 0.1 seconds, then with <italic>r</italic> = 10 and <italic>r</italic> = 50 we are able to predict the motion of the objects up to one and five seconds forward, respectively, in the same trial. However, this value can be changed depending on the application's requirements and the object's behavior. The statistical results presented below for each mentioned case show the precision of our proposal to predict trespassing situations.</p>
<sec>
<label>3.1.</label>
<title>Single Laser with Single Object Prediction</title>
<p><xref ref-type="fig" rid="f5-sensors-12-11870">Figures 5</xref> and <xref ref-type="fig" rid="f6-sensors-12-11870">6</xref> show two different restricted workspaces (solid dark grey). The range laser measurements are represented by red dots and the scanned area is in light grey. The blue circles represent the estimated object's position. Such an estimation is performed by the object detection procedure presented in Section 2.3. For visualization purposes, the Cartesian coordinate frame is attached to the sensor's position ([<italic>x<sub>laser</sub> y<sub>laser</sub></italic>]<italic><sup>T</sup></italic> = [0 0]<italic><sup>T</sup></italic>, with an orientation <italic>θ<sub>laser</sub></italic> = <italic>π</italic>/2) and the detected objects are referred to such a coordinate frame. The small black segments associated with the estimated objects (blue circles) represent the path predicted by our proposal. Such a path is based on the successive prediction of the object's position made by the Taylor's series expansion, as previously shown in <xref rid="FD8" ref-type="disp-formula">Equation (8)</xref>.</p>
<p><xref ref-type="fig" rid="f5-sensors-12-11870">Figure 5(a)–5(d)</xref> show four different situations in which our proposal predicts the single object movements; <xref ref-type="fig" rid="f5-sensors-12-11870">Figure 5(e)</xref> shows a close-up of <xref ref-type="fig" rid="f5-sensors-12-11870">Figure 5(c)</xref> for visualization purposes of the prediction behavior. <xref ref-type="fig" rid="f5-sensors-12-11870">Figure 5(f)</xref> shows the statistical results for this single object first approach. With <italic>r</italic> = 10 and for 25 trials in which the object/subject was intended to enter into the restricted workspace, our proposal was able to predict 100% of the cases of such a trespassing intention. However, for 25 trials in which the object/subject was not intended to trespass, our system was able to detect only 92% of the cases (<italic>i.e.</italic>, 23 trials) of such an intention of not trespassing. As can be seen, we have obtained a high rate of positive predictions.</p>
<p>In addition, with <italic>r</italic> = 50 and for 25 trials in which the object/subject was intended to trespass, our system was able to predict the 100% of the cases. However, for 25 trials in which the object/subject was not intended to trespass, we were able to predict the 60% of the cases (<italic>i.e.</italic>, 15 trials). That is, in the 40% of the remaining trials our system predicted the subject's intention (using <xref rid="FD8" ref-type="disp-formula">Equation (8)</xref>) to be to trespass when his/her actual intention was the opposite. Such a 60% prediction correctness is due to the horizon of prediction (<italic>r</italic> = 50). With <italic>r</italic> = 10 our system was able to predict the subject's motion up to one second before the motion; however, for <italic>r</italic> = 50, our proposal predicts the subject's behavior up to five seconds before his/her movements. Therefore, a higher rate of false predictions was expected.</p>
<p><xref ref-type="fig" rid="f6-sensors-12-11870">Figure 6</xref> shows another example of the single object prediction for a single-laser supervision application. <xref ref-type="fig" rid="f6-sensors-12-11870">Figure 6(a) and 6(b)</xref> show two trials. The restricted workspace is different from the one shown in <xref ref-type="fig" rid="f5-sensors-12-11870">Figure 5</xref>. For this new scenario, the statistical results, presented in <xref ref-type="fig" rid="f6-sensors-12-11870">Figure 6(c)</xref>, show that for <italic>r</italic> = 10 and <italic>r</italic> = 50, the system was able to predict the 100% of the cases when the object/subject was intended to enter into the restricted workspace. However, when the intention of the object/subject was to not trespass, the proposed system was able to detect such an intention for 96% of the cases with <italic>r</italic> = 10 and for 76% of the cases with <italic>r</italic> = 50. As can be seen, the statistical results shown in <xref ref-type="fig" rid="f5-sensors-12-11870">Figure 5(c)</xref> shows the same behavior than the results shown in <xref ref-type="fig" rid="f5-sensors-12-11870">Figure 5(f)</xref>. Nevertheless, the results shown in <xref ref-type="fig" rid="f6-sensors-12-11870">Figure 6</xref> are slightly better than the ones shown in <xref ref-type="fig" rid="f5-sensors-12-11870">Figure 5</xref>.</p></sec>
<sec>
<label>3.2.</label>
<title>Single Laser with Multiple Objects Prediction</title>
<p><xref ref-type="fig" rid="f7-sensors-12-11870">Figures 7</xref> and <xref ref-type="fig" rid="f8-sensors-12-11870">8</xref> show the multi-objects case for the restricted workspaces shown in <xref ref-type="fig" rid="f5-sensors-12-11870">Figures 5</xref> and <xref ref-type="fig" rid="f6-sensors-12-11870">6</xref>, respectively. In both cases, up to three subjects/objects were detected.</p>
<p>In <xref ref-type="fig" rid="f7-sensors-12-11870">Figure 7(a)</xref>, the object/subject's intention was to avoid the restricted workspace whereas in <xref ref-type="fig" rid="f7-sensors-12-11870">Figure 7(b)</xref> at least one subject intends to trespass such a workspace. <xref ref-type="fig" rid="f7-sensors-12-11870">Figure 7(c)</xref> shows the statistical results from 50 trials; in the first 25 trials, at least one of the object/subject's intention was to enter into the restricted workspace. In the remaining 25 trials, the intention of the moving objects was to avoid trespassing. As can be seen, with <italic>r</italic> = 10 and <italic>r</italic> = 50, our system has predicted 100% of trespassing cases. However, for the prediction of the not trespassing case, our proposal presented a 92% of success for <italic>r</italic> = 10 and 72% for <italic>r</italic> = 50.</p>
<p>With the same insight, <xref ref-type="fig" rid="f8-sensors-12-11870">Figure 8</xref> shows two examples of the multi-object detection using the restricted workspace shown in <xref ref-type="fig" rid="f6-sensors-12-11870">Figures 6</xref>–<xref ref-type="fig" rid="f8-sensors-12-11870">8(b)</xref>. In addition, <xref ref-type="fig" rid="f8-sensors-12-11870">Figure 8(c)</xref> shows the statistical results for the experiment. As can be seen, for <italic>r</italic> = 10 and <italic>r</italic> = 50, there is 100% of achievement when the system is used to predict the trespassing of multiple objects when they intended to do so. However, when the intention was to avoid trespassing, for <italic>r</italic> = 10 the system showed 92% of effectiveness; for <italic>r</italic> = 50, the system showed 72% of effectiveness in the prediction. It is worth mentioning that, as stated for the previous experiment, 25 trials were run for each situation shown in <xref ref-type="fig" rid="f8-sensors-12-11870">Figure 8(c)</xref>.</p></sec>
<sec>
<label>3.3.</label>
<title>Multiple Lasers with Single Object Prediction</title>
<p>As previously stated, we have implemented our supervision application to a system with multiple range lasers, as the one shown in <xref ref-type="fig" rid="f9-sensors-12-11870">Figures 9</xref> and <xref ref-type="fig" rid="f10-sensors-12-11870">10</xref>. The sensors disposition is as follows: one laser is located at [<italic>x</italic><sub><italic>laser</italic>,1</sub> <italic>y</italic><sub><italic>laser</italic>,1</sub>]<italic><sup>T</sup></italic> = [0 0]<italic><sup>T</sup></italic>, with an orientation <italic>θ</italic><sub><italic>laser</italic>,1</sub> = <italic>π</italic>/2; whereas the second laser is located at [<italic>x</italic><sub><italic>laser</italic>,2</sub> <italic>y</italic><sub><italic>laser</italic>,2</sub>]<italic><sup>T</sup></italic> = [5 5]<italic><sup>T</sup></italic>, with an orientation <italic>θ</italic><sub><italic>laser</italic>,2</sub> = <italic>π</italic>. The maximum range of measurement, for both lasers, is set to 8 meters. The solid grey area is the common restricted workspace. The first laser prediction is drawn in solid black segments whereas the second laser prediction is drawn in solid green segments. It is worth mentioning that each laser has implemented the prediction strategy proposed in this work; in addition, they work independently. The latter means that each laser has associated its own predictor based on its own moving object detection stage. Thus, one laser might detect the moving object in a different position than the detection performed by the other laser. This is so because the histogram detection method used herein ([<xref ref-type="bibr" rid="b15-sensors-12-11870">15</xref>]) depends on the shape of the object. Then, if two detections are different, their corresponding predictions might be different as well, as shown in <xref rid="FD8" ref-type="disp-formula">Equation (8)</xref>. Blue circles in <xref ref-type="fig" rid="f9-sensors-12-11870">Figures 9</xref> and <xref ref-type="fig" rid="f10-sensors-12-11870">10</xref> represent the detected object.</p>
<p><xref ref-type="fig" rid="f9-sensors-12-11870">Figure 9(a) and 9(b)</xref> show two examples of the experiment carried out using two lasers and a common restricted workspace; <xref ref-type="fig" rid="f9-sensors-12-11870">Figure 9(c)</xref> presents the statistical results of the experiment which are consistent with the results shown for the previous experiments. For <italic>r</italic> = 10 and <italic>r</italic> = 50, the system predicted the 100% of the cases when the intention of the object/subject was to trespass the restricted workspace. However, when the intention was to avoid trespassing, the system predicted the 84% of the cases when <italic>r</italic> = 10 and 76% when <italic>r</italic> = 50. It is worth mentioning that 25 trials were carried out for each case, as stated in the previous sections.</p></sec>
<sec>
<label>3.4.</label>
<title>Multiple Lasers with Multiple Objects Prediction</title>
<p>As mentioned in Section 3.3, <xref ref-type="fig" rid="f10-sensors-12-11870">Figure 10</xref> shows the multi-object prediction by a multi-laser system using a common restricted workspace. Up to three objects/subjects were part of the experiment. <xref ref-type="fig" rid="f10-sensors-12-11870">Figure 10(a) and 10(b)</xref> show two examples of this situation whereas <xref ref-type="fig" rid="f10-sensors-12-11870">Figure 10(c)</xref> shows the statistical results. As can be seen, when the intention was to enter into the restricted workspace, the system was able to predict the 100% of the cases for both <italic>r</italic> = 10 and <italic>r</italic> = 50. However, as observed for the previous experiments, when the intention was to avoid trespassing, for <italic>r</italic> = 10 the system showed 88% effectiveness. For <italic>r</italic> = 50, the system showed also 88% effectiveness.</p></sec></sec>
<sec sec-type="discussion">
<label>4.</label>
<title>Discussion and Lessons Learned</title>
<p>During the experimentation, a number of lessons were learned with regard to the supervision application strategy based on the Taylor's prediction criterion proposed in this work. First, the precision of the prediction is strongly related to the precision of the detection procedure. Thus, a noisy detection procedure can transform a movement that originally belongs to <italic>C</italic><sup>2</sup>—which is associated with a smooth movement—into a movement that belongs to <italic>C</italic><sup>0</sup>, such as an arbitrary movement.</p>
<p>Second, the effectiveness of the prediction is also affected by the horizon used in the implementation. As shown in the statistical results in Sections 3.1–3.4, for <italic>r</italic> = 10 we have obtained better results in predicting the motion of the objects when the intention was to avoid the restricted workspace. However, in general, for <italic>r</italic> = 50 the system has shown worst results, mainly due to the fact that when <italic>r</italic> = 50 the system formulates a prediction up to 5 seconds forward. As expected, during this time, the object can change its motion which can make the prediction to fail. It is worth mentioning that, once the predicted motion had estimated that the object will trespass, the action execution of the system was to emit an alarm.</p>
<p>Third, the multi-object case with both single or multi-laser situations has shown similar results than the single-object case. Despite the fact that each object was predicted independently, the objects detection procedure used has shown to be efficient for the application. In addition, it is worth mentioning that we have used subjects as objects for the execution of the experimentation.</p>
<p>Fourth, if the detected object moves following a straight line and the detection method is too noisy, then the system will face a situation in which a linear movement might be detected as a random one. Considering that the error in the detection is propagated to the prediction, it also conditions the order of the Taylor's expansion prediction to be used in the process. Therefore, it is recommendable to have previous information regarding the detection method's efficiency before choosing the order of the Taylor's expansion and its corresponding horizon of prediction.</p></sec>
<sec sec-type="conclusions">
<label>5.</label>
<title>Conclusions</title>
<p>This paper has presented a new prediction method based on the Taylor's series expansion of the motion of an object given its detection parameters. The accuracy of the method is related to the maximum order adopted for the Taylor's expansion. Considering the algebraic formulation of the prediction method, it is suitable for implementation in embedded systems. Also, it is scalable: it can be adapted to the number of objects whose motions are going to be predicted.</p>
<p>In addition, the proposed method was implemented in range laser-based supervision systems for the prediction of trespassing situations. Such situations are common when working in restricted environments and free motion is not allowed due to risky situations. Our proposal has shown to be effective to predict future trespassing situations. With this insight, two main cases were presented: the single-laser case with both single object and multi-object prediction; and the multi-laser case with both single object and multi-object prediction. For all the cases, our proposal had shown a 100% of effectiveness in predicting intended trespassing situations. However, the system had also predicted false trespassing situations—<italic>i.e.</italic>, the object moved close to the restricted workspace without trespassing it. It is worth mentioning than 25 trials were run for each experimental case using two different horizon values: the prediction up to 10 times forward and up to 50 times forward. Predictions with an horizon of 10 times forward have shown better statistical results than predictions with an horizon of 50 times forwards. Several workspace dispositions were used to test our proposal.</p></sec></body>
<back>
<ack>
<p>The authors would like to thank to the Department of Electronics Engineering, <italic>Universidad Técnica Federico Santa María</italic>, Valparaíso, Chile; to the Institute of Chemistry, <italic>Universidad Nacional de San Juan</italic> and to the CONICET (<italic>Consejo Nacional de Investigaciones Científicas y Técnicas</italic>), Argentina; BASAL's project number FB/01FA/12 and DGIP project 23.12.09.</p></ack>
<ref-list>
<title>References</title>
<ref id="b1-sensors-12-11870"><label>1.</label><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Collins</surname><given-names>R.</given-names></name><name><surname>Lipton</surname><given-names>A.</given-names></name><name><surname>Fijiyoshi</surname><given-names>H.</given-names></name><name><surname>Kanade</surname><given-names>T.</given-names></name></person-group><article-title>Algorithms for cooperative multisensor surveillance</article-title><source>Proc. IEEE</source><year>2001</year><volume>89</volume><fpage>1456</fpage><lpage>1477</lpage><pub-id pub-id-type="doi">10.1109/5.959341</pub-id></citation></ref>
<ref id="b2-sensors-12-11870"><label>2.</label><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Comaniciu</surname><given-names>D.</given-names></name><name><surname>Ramesh</surname><given-names>V.</given-names></name><name><surname>Meer</surname><given-names>P.</given-names></name></person-group><article-title>Kernel-based object tracking</article-title><source>IEEE Trans. Pattern Anal. Mach. Intell.</source><year>2003</year><volume>25</volume><fpage>564</fpage><lpage>577</lpage><pub-id pub-id-type="doi">10.1109/TPAMI.2003.1195991</pub-id></citation></ref>
<ref id="b3-sensors-12-11870"><label>3.</label><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Auat Cheein</surname><given-names>F.</given-names></name><name><surname>di Sciascio</surname><given-names>F.</given-names></name><name><surname>Scaglia</surname><given-names>G.</given-names></name><name><surname>Carelli</surname><given-names>R.</given-names></name></person-group><article-title>Towards features updating selection based on the covariance matrix of the slam system state</article-title><source>Robotica</source><year>2010</year><volume>29</volume><fpage>271</fpage><lpage>282</lpage></citation></ref>
<ref id="b4-sensors-12-11870"><label>4.</label><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Durrant-Whyte</surname><given-names>H.</given-names></name><name><surname>Bailey</surname><given-names>T.</given-names></name></person-group><article-title>Simultaneous localization and mapping (SLAM): Part I. Essential algorithms</article-title><source>IEEE Robot. Autom. Mag.</source><year>2006</year><volume>13</volume><fpage>99</fpage><lpage>108</lpage></citation></ref>
<ref id="b5-sensors-12-11870"><label>5.</label><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Huang</surname><given-names>J.</given-names></name><name><surname>Kumar</surname><given-names>S.</given-names></name><name><surname>Mitra</surname><given-names>M.</given-names></name><name><surname>Zhu</surname><given-names>W.</given-names></name><name><surname>Zabih</surname><given-names>R.</given-names></name></person-group><article-title>Spatial color indexing and applications</article-title><source>Int. J. Comput. Vision</source><year>1999</year><volume>35</volume><fpage>245</fpage><lpage>268</lpage><pub-id pub-id-type="doi">10.1023/A:1008108327226</pub-id></citation></ref>
<ref id="b6-sensors-12-11870"><label>6.</label><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Amer</surname><given-names>A.</given-names></name></person-group><article-title>Voting-based simultaneous tracking of multiple video objects</article-title><source>IEEE Trans. Circuits Syst. Video Technol.</source><year>2005</year><volume>15</volume><fpage>1448</fpage><lpage>1462</lpage><pub-id pub-id-type="doi">10.1109/TCSVT.2005.857311</pub-id></citation></ref>
<ref id="b7-sensors-12-11870"><label>7.</label><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Riera</surname><given-names>J.</given-names></name><name><surname>Parrilla</surname><given-names>E.</given-names></name><name><surname>Hueso</surname><given-names>J.</given-names></name></person-group><article-title>Object tracking with a stereoscopic camera: Exploring the three-dimensional space</article-title><source>Eur. J. Phys.</source><year>2011</year><volume>32</volume><fpage>235</fpage><lpage>243</lpage><pub-id pub-id-type="doi">10.1088/0143-0807/32/1/022</pub-id></citation></ref>
<ref id="b8-sensors-12-11870"><label>8.</label><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Qu</surname><given-names>W.</given-names></name><name><surname>Schonfeld</surname><given-names>D.</given-names></name></person-group><article-title>Real-time decentralized articulated motion analysis and object tracking from videos</article-title><source>IEEE Trans. Image Process.</source><year>2007</year><volume>16</volume><fpage>2129</fpage><lpage>2138</lpage><pub-id pub-id-type="doi">10.1109/TIP.2007.899619</pub-id><pub-id pub-id-type="pmid">17688217</pub-id></citation></ref>
<ref id="b9-sensors-12-11870"><label>9.</label><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Yoon</surname><given-names>Y.</given-names></name><name><surname>Kosaka</surname><given-names>A.</given-names></name><name><surname>Kak</surname><given-names>A.</given-names></name></person-group><article-title>A new Kalman-filter-based framework for fast and accurate visual tracking of rigid objects</article-title><source>IEEE Trans. Robot.</source><year>2008</year><volume>24</volume><fpage>1238</fpage><lpage>1251</lpage><pub-id pub-id-type="doi">10.1109/TRO.2008.2003281</pub-id></citation></ref>
<ref id="b10-sensors-12-11870"><label>10.</label><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Vadakkepat</surname><given-names>P.</given-names></name><name><surname>Jing</surname><given-names>L.</given-names></name></person-group><article-title>Improved particle filter in sensor fusion of tracking randomly moving object</article-title><source>IEEE Trans. Instrum. Meas.</source><year>2006</year><volume>55</volume><fpage>1823</fpage><lpage>1832</lpage><pub-id pub-id-type="doi">10.1109/TIM.2006.881569</pub-id></citation></ref>
<ref id="b11-sensors-12-11870"><label>11.</label><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Hariharakrishnan</surname><given-names>K.</given-names></name><name><surname>Schonfeld</surname><given-names>D.</given-names></name></person-group><article-title>Fast object tracking using adaptive block matching</article-title><source>IEEE Trans. Multimed.</source><year>2005</year><volume>7</volume><fpage>853</fpage><lpage>859</lpage><pub-id pub-id-type="doi">10.1109/TMM.2005.854437</pub-id></citation></ref>
<ref id="b12-sensors-12-11870"><label>12.</label><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Collins</surname><given-names>R.</given-names></name><name><surname>Liu</surname><given-names>Y.</given-names></name><name><surname>Leordeanu</surname><given-names>M.</given-names></name></person-group><article-title>Online selection of discriminative tracking features</article-title><source>IEEE Trans. Pattern Anal. Mach. Intell.</source><year>2005</year><volume>27</volume><fpage>1631</fpage><lpage>1643</lpage><pub-id pub-id-type="doi">10.1109/TPAMI.2005.205</pub-id><pub-id pub-id-type="pmid">16237997</pub-id></citation></ref>
<ref id="b13-sensors-12-11870"><label>13.</label><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Jepson</surname><given-names>A.</given-names></name><name><surname>Fleet</surname><given-names>D.</given-names></name><name><surname>El-Maraghi</surname><given-names>T.</given-names></name></person-group><article-title>Robust online appearance models for visual tracking</article-title><source>IEEE Trans. Pattern Anal. Mach. Intell.</source><year>2003</year><volume>25</volume><fpage>1296</fpage><lpage>1311</lpage><pub-id pub-id-type="doi">10.1109/TPAMI.2003.1233903</pub-id></citation></ref>
<ref id="b14-sensors-12-11870"><label>14.</label><citation citation-type="confproc"><person-group person-group-type="author"><name><surname>Tamjidi</surname><given-names>A.</given-names></name><name><surname>Taghirad</surname><given-names>H.D.</given-names></name><name><surname>Aghamohammadi</surname><given-names>A.</given-names></name></person-group><article-title>On the Consistency of EKF-SLAM: Focusing on the Observation Models</article-title><conf-name>Proceedings of the IEEE International Conference on Intelligent Robots and Systems (IROS)</conf-name><conf-loc>St. Louis, MO, USA</conf-loc><conf-date>10–15 October 2009</conf-date><fpage>2083</fpage><lpage>2088</lpage></citation></ref>
<ref id="b15-sensors-12-11870"><label>15.</label><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Auat Cheein</surname><given-names>F.</given-names></name><name><surname>Carelli</surname><given-names>R.</given-names></name></person-group><article-title>Analysis of different features selection criteria based on a covariance convergence perspective for a SLAM algorithm</article-title><source>Sensors</source><year>2011</year><volume>11</volume><fpage>62</fpage><lpage>89</lpage><pub-id pub-id-type="doi">10.1109/JSEN.2010.2050475</pub-id><pub-id pub-id-type="pmid">22346568</pub-id></citation></ref>
<ref id="b16-sensors-12-11870"><label>16.</label><citation citation-type="book"><person-group person-group-type="author"><name><surname>Thrun</surname><given-names>S</given-names></name><name><surname>Burgard</surname><given-names>W</given-names></name><name><surname>Fox</surname><given-names>D.</given-names></name></person-group><source>Probabilistic Robotics</source><publisher-name>MIT Press</publisher-name><publisher-loc>Cambridge, MA, USA</publisher-loc><year>2005</year><fpage>667</fpage></citation></ref>
<ref id="b17-sensors-12-11870"><label>17.</label><citation citation-type="confproc"><person-group person-group-type="author"><name><surname>Paz</surname><given-names>L.M.</given-names></name><name><surname>Jensfelt</surname><given-names>P.</given-names></name><name><surname>Tardos</surname><given-names>J.D.</given-names></name><name><surname>Neira</surname><given-names>J.</given-names></name></person-group><article-title>EKF SLAM Updates in on with Divide and Conquer SLAM</article-title><conf-name>Proceedings of the IEEE International Conference on Robotics and Automation</conf-name><conf-loc>Roma, Italy</conf-loc><conf-date>10–14 April 2007</conf-date><fpage>1657</fpage><lpage>1663</lpage></citation></ref>
<ref id="b18-sensors-12-11870"><label>18.</label><citation citation-type="confproc"><person-group person-group-type="author"><name><surname>Cadena</surname><given-names>C.</given-names></name><name><surname>Neira</surname><given-names>J.</given-names></name></person-group><article-title>SLAM in O(log n) with the Combined Kalman-Information Filter</article-title><conf-name>Proceedings of the IEEE International Conference on Intelligent Robots and Systems (IROS)</conf-name><conf-loc>St. Louis, MO, USA</conf-loc><conf-date>10–15 October 2009</conf-date><fpage>2069</fpage><lpage>2076</lpage></citation></ref>
<ref id="b19-sensors-12-11870"><label>19.</label><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Auat Cheein</surname><given-names>F.</given-names></name><name><surname>Scaglia</surname><given-names>G.</given-names></name><name><surname>di Sciascio</surname><given-names>F.</given-names></name><name><surname>Carelli</surname><given-names>R.</given-names></name></person-group><article-title>Feature selection algorithm for real time EKF-SLAM algorithm</article-title><source>Int. J. Adv. Robot. Syst.</source><year>2009</year><volume>6</volume><fpage>229</fpage><lpage>238</lpage></citation></ref>
<ref id="b20-sensors-12-11870"><label>20.</label><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Auat Cheein</surname><given-names>F.</given-names></name><name><surname>Steiner</surname><given-names>G.</given-names></name><name><surname>Perez Paina</surname><given-names>G.</given-names></name><name><surname>Carelli</surname><given-names>R.</given-names></name></person-group><article-title>Optimized EIF-SLAM algorithm for precision agriculture mapping based on visual stems detection</article-title><source>Comput. Electron. Agric.</source><year>2011</year><volume>78</volume><fpage>195</fpage><lpage>207</lpage><pub-id pub-id-type="doi">10.1016/j.compag.2011.07.007</pub-id></citation></ref>
<ref id="b21-sensors-12-11870"><label>21.</label><citation citation-type="confproc"><person-group person-group-type="author"><name><surname>Zang</surname><given-names>Y.</given-names></name><name><surname>Yuan</surname><given-names>K.</given-names></name><name><surname>Zou</surname><given-names>W.</given-names></name><name><surname>Hu</surname><given-names>H.</given-names></name></person-group><article-title>A Two-Step Particle Filter for SLAM of Corridor Environment</article-title><conf-name>Proceedings of the IEEE International Conference on Information Acquisition</conf-name><conf-loc>Weihai, Shandong, China</conf-loc><conf-date>20–23 August 2006</conf-date><fpage>370</fpage><lpage>375</lpage></citation></ref>
<ref id="b22-sensors-12-11870"><label>22.</label><citation citation-type="web"><article-title>Mobile area protection on a production line (SICK)</article-title><comment>Available online: <ext-link xlink:href="https://www.mysick.com/partnerPortal/ProductCatalog/DataSheet.aspx?ProductID=37959" ext-link-type="uri">https://www.mysick.com/partnerPortal/ProductCatalog/DataSheet.aspx?ProductID=37959</ext-link> (accessed on 3 August 2012)</comment></citation></ref>
<ref id="b23-sensors-12-11870"><label>23.</label><citation citation-type="web"><article-title>Hazardous area protection on a production line (SICK)</article-title><comment>Available online: <ext-link xlink:href="https://www.mysick.com/partnerPortal/ProductCatalog/DataSheet.aspx?ProductID=37956" ext-link-type="uri">https://www.mysick.com/partnerPortal/ProductCatalog/DataSheet.aspx?ProductID=37956</ext-link> (accessed on 3 August 2012)</comment></citation></ref>
<ref id="b24-sensors-12-11870"><label>24.</label><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Jiang</surname><given-names>H.</given-names></name><name><surname>Fels</surname><given-names>S.</given-names></name><name><surname>Little</surname><given-names>J.</given-names></name></person-group><article-title>Optimizing multiple object tracking and best view video synthesis</article-title><source>IEEE Trans. Multimed.</source><year>2008</year><volume>10</volume><fpage>997</fpage><lpage>1012</lpage><pub-id pub-id-type="doi">10.1109/TMM.2008.2001379</pub-id></citation></ref>
<ref id="b25-sensors-12-11870"><label>25.</label><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Stauffer</surname><given-names>C.</given-names></name><name><surname>Grimson</surname><given-names>E.</given-names></name></person-group><article-title>Learning patterns of activity using real-time tracking</article-title><source>IEEE Trans. Pattern Anal. Mach. Intell.</source><year>2000</year><volume>22</volume><fpage>747</fpage><lpage>757</lpage><pub-id pub-id-type="doi">10.1109/34.868677</pub-id></citation></ref>
<ref id="b26-sensors-12-11870"><label>26.</label><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Wu</surname><given-names>H.</given-names></name><name><surname>Sankaranarayanan</surname><given-names>A.</given-names></name><name><surname>Chellappa</surname><given-names>R.</given-names></name></person-group><article-title>Online empirical evaluation of tracking algorithms</article-title><source>IEEE Trans. Pattern Anal. Mach. Intell.</source><year>2010</year><volume>32</volume><fpage>1443</fpage><lpage>1458</lpage><pub-id pub-id-type="doi">10.1109/TPAMI.2009.135</pub-id><pub-id pub-id-type="pmid">20558876</pub-id></citation></ref>
<ref id="b27-sensors-12-11870"><label>27.</label><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Jiang</surname><given-names>J.</given-names></name><name><surname>Zhang</surname><given-names>G.</given-names></name><name><surname>Wei</surname><given-names>X.</given-names></name><name><surname>Li</surname><given-names>X.</given-names></name></person-group><article-title>Rapid star tracking algorithm for star sensor</article-title><source>IEEE A&amp;E Syst. Mag.</source><year>2009</year><volume>28</volume><fpage>23</fpage><lpage>33</lpage></citation></ref>
<ref id="b28-sensors-12-11870"><label>28.</label><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Lim</surname><given-names>J.</given-names></name><name><surname>Kim</surname><given-names>W.</given-names></name></person-group><article-title>Detecting and tracking of multiple pedestrian using information motion, color informatin and the AdaBoost algorithm</article-title><source>Multimed. Tools Appl.</source><year>2012</year><pub-id pub-id-type="doi">10.1007/s11042-012-1156-3</pub-id></citation></ref>
<ref id="b29-sensors-12-11870"><label>29.</label><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Gao</surname><given-names>T.</given-names></name><name><surname>Li</surname><given-names>G.</given-names></name><name><surname>Lian</surname><given-names>S.</given-names></name><name><surname>Zhang</surname><given-names>J.</given-names></name></person-group><article-title>Tracking video objects with feature points based particle filtering</article-title><source>Multimed. Tools Appl.</source><year>2012</year><volume>58</volume><fpage>1</fpage><lpage>21</lpage><pub-id pub-id-type="doi">10.1007/s11042-010-0676-y</pub-id></citation></ref>
<ref id="b30-sensors-12-11870"><label>30.</label><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Zhang</surname><given-names>Z.</given-names></name><name><surname>Liu</surname><given-names>X.</given-names></name><name><surname>Yang</surname><given-names>G.</given-names></name><name><surname>Min</surname><given-names>J.</given-names></name></person-group><article-title>Application and research on extended kalman prediction algorithm in target tracking system</article-title><source>Lect. Notes Electr. Eng.</source><year>2011</year><volume>138</volume><fpage>1167</fpage><lpage>1173</lpage></citation></ref>
<ref id="b31-sensors-12-11870"><label>31.</label><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Broida</surname><given-names>T.</given-names></name><name><surname>Chandrashekhar</surname><given-names>S.</given-names></name><name><surname>Chellappa</surname><given-names>R.</given-names></name></person-group><article-title>Recursive 3-D motion estimation from a monocual image sequence</article-title><source>IEEE Trans. Aerosp. Electron. Syst.</source><year>1990</year><volume>24</volume><fpage>639</fpage><lpage>656</lpage></citation></ref>
<ref id="b32-sensors-12-11870"><label>32.</label><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Huang</surname><given-names>W.</given-names></name><name><surname>Ollis</surname><given-names>M.</given-names></name><name><surname>Happold</surname><given-names>M.</given-names></name><name><surname>Stancil</surname><given-names>B.</given-names></name></person-group><article-title>Image-based path planning for outdoor mobile robots</article-title><source>J. Field Robot.</source><year>2009</year><volume>26</volume><fpage>196</fpage><lpage>211</lpage><pub-id pub-id-type="doi">10.1002/rob.20272</pub-id></citation></ref>
<ref id="b33-sensors-12-11870"><label>33.</label><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Hadsell</surname><given-names>R.</given-names></name><name><surname>Sermanet</surname><given-names>P.</given-names></name><name><surname>Ben</surname><given-names>J.</given-names></name><name><surname>Erkan</surname><given-names>A.</given-names></name><name><surname>Scoffier</surname><given-names>M.</given-names></name><name><surname>Kavukcuoglu</surname><given-names>K.</given-names></name><name><surname>Muller</surname><given-names>U.</given-names></name><name><surname>LeCun</surname><given-names>Y.</given-names></name></person-group><article-title>Image long-range vision for autonomous off-road driving</article-title><source>J. Field Robot.</source><year>2009</year><volume>26</volume><fpage>120</fpage><lpage>144</lpage><pub-id pub-id-type="doi">10.1002/rob.20276</pub-id></citation></ref>
<ref id="b34-sensors-12-11870"><label>34.</label><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Tsagkatakis</surname><given-names>G.</given-names></name><name><surname>Savakis</surname><given-names>A.</given-names></name></person-group><article-title>Online distance metric learning for object tracking</article-title><source>IEEE Trans. Circuits Syst. Video Technol.</source><year>2011</year><volume>21</volume><fpage>1810</fpage><lpage>1821</lpage><pub-id pub-id-type="doi">10.1109/TCSVT.2011.2133970</pub-id></citation></ref>
<ref id="b35-sensors-12-11870"><label>35.</label><citation citation-type="book"><person-group person-group-type="author"><name><surname>Auat Cheein</surname><given-names>F.</given-names></name><name><surname>di Sciascio</surname><given-names>F.</given-names></name><name><surname>Bastos Filho</surname><given-names>T.</given-names></name><name><surname>Carelli</surname><given-names>R.</given-names></name></person-group><article-title>Towards a Probabilistic Manipulator Robot's Workspace Governed by a BCI</article-title><source>Communications in Computer and Information Science</source><person-group person-group-type="editor"><name><surname>Fred</surname><given-names>A.</given-names></name><name><surname>Filipe</surname><given-names>J.</given-names></name><name><surname>Gamboa</surname><given-names>H.</given-names></name></person-group><publisher-name>Springer-Verlag</publisher-name><publisher-loc>Berlin/Heidelberg, Germany</publisher-loc><year>2008</year><fpage>73</fpage><lpage>84</lpage></citation></ref>
<ref id="b36-sensors-12-11870"><label>36.</label><citation citation-type="book"><person-group person-group-type="author"><name><surname>Siegwart</surname><given-names>R.</given-names></name><name><surname>Nourbahsh</surname><given-names>I.</given-names></name></person-group><source>Introduction to Autonomous Mobile Robots</source><publisher-name>MIT Press</publisher-name><publisher-loc>Cambridge, MA, USA</publisher-loc><year>2004</year></citation></ref></ref-list>
<sec sec-type="display-objects">
<title>Figures</title>
<fig id="f1-sensors-12-11870" position="float">
<label>Figure 1.</label>
<caption>
<p>General system architecture.</p></caption>
<graphic xlink:href="sensors-12-11870f1.gif"/></fig>
<fig id="f2-sensors-12-11870" position="float">
<label>Figure 2.</label>
<caption>
<p>Examples of object prediction. (<bold>a</bold>) shows the case when the predicted movements fall within the restricted region of the workspace; (<bold>b</bold>) shows the case when the prediction does not fall within the restricted area.</p></caption>
<graphic xlink:href="sensors-12-11870f2.gif"/></fig>
<fig id="f3-sensors-12-11870" position="float">
<label>Figure 3.</label>
<caption>
<p>Range laser sensor used in this work.</p></caption>
<graphic xlink:href="sensors-12-11870f3.gif"/></fig>
<fig id="f4-sensors-12-11870" position="float">
<label>Figure 4.</label>
<caption>
<p>Three examples of restricted workspace configuration.</p></caption>
<graphic xlink:href="sensors-12-11870f4.gif"/></fig>
<fig id="f5-sensors-12-11870" position="float">
<label>Figure 5.</label>
<caption>
<p>Single object prediction approach: first case. (<bold>a–d</bold>) different cases; (<bold>e</bold>) a close-up of the predicted movements; (<bold>f</bold>) the statistical results of the experimentation.</p></caption>
<graphic xlink:href="sensors-12-11870f5.gif"/></fig>
<fig id="f6-sensors-12-11870" position="float">
<label>Figure 6.</label>
<caption>
<p>Single object prediction approach: second case. (<bold>a,b</bold>) two examples; (<bold>c</bold>) the statistical results of the experiment.</p></caption>
<graphic xlink:href="sensors-12-11870f6.gif"/></fig>
<fig id="f7-sensors-12-11870" position="float">
<label>Figure 7.</label>
<caption>
<p>First approach of the multi-object detection using a single laser sensor. (<bold>a,b</bold>) two examples; (<bold>c</bold>) the statistical results of the experiment.</p></caption>
<graphic xlink:href="sensors-12-11870f7.gif"/></fig>
<fig id="f8-sensors-12-11870" position="float">
<label>Figure 8.</label>
<caption>
<p>Second approach of the multi-object detection using a single laser sensor.</p></caption>
<graphic xlink:href="sensors-12-11870f8.gif"/></fig>
<fig id="f9-sensors-12-11870" position="float">
<label>Figure 9.</label>
<caption>
<p>Single object prediction by a multi-laser disposition. (<bold>a,b</bold>) two examples of the performed experiment; (<bold>c</bold>) the statistical results of the experiment.</p></caption>
<graphic xlink:href="sensors-12-11870f9.gif"/></fig>
<fig id="f10-sensors-12-11870" position="float">
<label>Figure 10.</label>
<caption>
<p>Multi-object prediction using a multi-laser disposition. (<bold>a,b</bold>) two examples of the performed experiment; (<bold>c</bold>) the statistical results of the experiment.</p></caption>
<graphic xlink:href="sensors-12-11870f10a.gif"/>
<graphic xlink:href="sensors-12-11870f10b.gif"/></fig></sec></back></article>
