Skip to main content

Mobile adaptive crowd optimization scheme based on distance field


For complexity and efficiency of the multi-objective optimization, we proposed the mobile distance field-driven adaptive crowd optimization algorithm. In space, we modify the surface parameters based on the corresponding changes of the distance field to obtain the moving target’s moving track and moving surface. When the curve of the moving track is changed, the x axis and the y axis of the moving track are adjusted adaptively. In this paper, the moving process is divided into three processes: the target dynamic crowd control, the crowd model algorithm, and the predictive control of linear time domain based on the moving target prediction and crowd control algorithm. Then, the multi-objective optimization algorithm of moving objects is proposed by using the crowd model to predict the status and the position of the target. The experimental results show the high accuracy, low complexity, and high efficiency of the proposed optimization algorithm.

1 Introduction

Multi-objective optimization can be applied to a large number of practical applications [1]. The multi-objective optimization of the practical problems requires [2] simple architecture, easy implementation, low complexity, and low [3] and high optimization efficiency. However, the above features are often contradictory [4]. The search of a compromise between multiple characteristics [5] becomes the key to the development of multi-objective optimization applications.

The new subspace clustering algorithm was proposed by the authors of article [6], which segments the videos into consistent spatial-temporal regions with multiple classes. A novel algorithm was presented in article [7] that exploits joint optimization of representation and classification for robust tracking in which the goal is to minimize the least-squares reconstruction errors and discriminative penalties with regularized constraints. In article [8], a multi-objective particle crowd optimization technique is applied to a group of consecutive frames to reduce the number of branches in each tracking tree. The novel algorithm was presented in the article [9] for the removal of reflections generated by objects on reflecting floors. The block-coordinate Gauss-Newton/regression method was proposed by Kim D S [10], in order to conduct a correlation-based registration considering the intensity difference between images in the presence of outlier objects. The projection image generation algorithm [11] was proposed to design and fabricate a complex 3D scaffold, which automatically and robustly generates 2D projection image data. The author of article [12] proposed a repeated use of screened Poisson to compute a part coding and extracting distance field. A highly scalable method was proposed in article [13] for computing 3D distance fields on massively parallel distributed-memory machines.

In view of the above achievements and problems, based on the multi-objective optimization model, we proposed adaptive mobile crowd optimization based on distance field. The rest of the paper is organized as follows: Section 2 describes the moving target distance field analysis model. Section 3 proposes the adaptive mobile crowd optimization. The performance evaluation is shown in Section 4. Finally, the conclusions are given in Section 5.

2 Moving target distance field analysis model

In space, the moving track and the moving surface of the moving target have the following form:

$$ \left\{\begin{array}{l}{S}_C=\left(\begin{array}{c}\hfill x\left(m,n,t\right)\hfill \\ {}\hfill y\left(m,n,t\right)\hfill \\ {}\hfill z\left(m,n,t\right)\hfill \end{array}\right)\\ {}{T}_C={\displaystyle \sum_{t=1}^T\frac{1}{2}{a}^2t}+{v}_0\end{array}\right. $$

Here, S C represents the surface formed by the moving object. T C represents the moving trajectory of a moving target. The t represents the moving time of the target. T represents the total length of the moving target. Parameters x, y, and z represent the three component of the three-dimensional space of the moving target. Parameter V 0 represents the initial movement speed. Parameter a indicates the acceleration. Symbols m and n are the parameters of the moving surface. The moving surface is usually determined by the range of parameters. According to the formula (1), the parameters of the moving surface can be easily generated. In the form of moving surface parameters, the dot sequence of the moving surface is generated. We can get the moving surface by the linear processing of the store sequence and take the parameter value. Therefore, it is very convenient and efficient to form and update the moving surface. The time linearized by the moving surface has the characteristics of free rotation, fast state transition, and so on.

Moving surface has a good character of time and space, but it is a difficult problem to obtain the moving data parameters of a given object. Because the moving object in the three-dimensional space must be consistent with the curve of the moving surface. We consider the distance field to avoid the curved surface distortion of moving objects. The distance field is the moving surfaces between two adjacent samples of the moving target. When the shape of the curved surface changes, we modify the surface parameterization based on the corresponding changes in the distance field to keep the matching relationship. When the structure of the moving trajectory changes, we decompose the moving trajectories in the x axis and the y axis according to the formula (2).

$$ \begin{array}{l}{T}_C=\left\{x\left(a,{v}_0\right),y\left({v}_0t, at+{v}_0\right)\right\}\left|{\displaystyle \sum_{t=1}^T\frac{1}{2}{a}^2t}+v\right.\\ {}\left\{\begin{array}{l}{T}_C>\varepsilon :\mathrm{Consistent}=1\\ {}{T}_C=\varepsilon :\mathrm{Consistent}=0\\ {}{T}_C>\varepsilon :\mathrm{Consistent}=2\end{array}\right.\end{array} $$

Here, ε is the threshold value of the curved surface. Parameter Consistent represents the degree of consistency between the moving objects in the three-dimensional space and the curvature of the moving surface. Number 1 indicates complete agreement. Number 0 is not consistent, can be adjusted according to the distance field. Number 2 indicates that it is not consistent and cannot be adjusted.

The distance field function of the moving target is the key to the optimization of the moving target. For the moving surface, the distance field function defines the direction of the moving point to the moving target. The distance field function of the moving surface is given in Eq. (3), which is shown in Fig. 1.

Fig. 1
figure 1

Distance field function

$$ f(d)=\left\{\begin{array}{l}d\left(p,{S}_C\right),\mathrm{Consistent}=1\\ {}\overline{d}\left(p,{S}_C\right),\mathrm{Consistent}=0\\ {}\overline{d}\left(p,{S}_C\right)\cdot {F}_d,\mathrm{Consistent}=2\end{array}\right. $$

Here, \( d\left(p,{S}_C\right)={\displaystyle \underset{p\in {S}_C}{ \lim }}\left({T}_C(t){S}_C(p)\right) \)

Surface treatment would be finished based on the moving target trajectory data \( P{\left\{{p}_i\right\}}_{t=1}^T \) with formula (1). The distance field function defined on the partition can make the matrix S C in the zero level. The state is able to approximate the distance field of the real-time data points of the moving target. This process can make the Consistent value of the data points of the moving target to be 1. The Consistent value can be fitted by minimizing the following function as shown in Eq. (4).

$$ \min {\displaystyle \sum_{i=1}^n{\left\Vert {\displaystyle \prod_{t=0}^T{S}_C(t){T}_C(i)}\right\Vert}^{\varepsilon }} $$

In summary, Fig. 2 gives the moving target distance field analysis structure for moving target data surfaces.

Fig. 2
figure 2

Surface data point of moving target

3 Adaptive mobile crowd optimization

3.1 Crowd model of moving target

Crowd model of the moving target is a linear fusion intelligent time domain mapping control model. The model is based on the cooperation of moving target prediction model and crowd control algorithm. The model includes the dynamic control, the crowd control model and the linear time domain predictive control. The crowd control can predict the status and position of moving objects by using crowd model. The crowd control model can design the mobile constraints and crowd optimization objectives based on the real-time mobile trajectory information. The model can generate the target state matrix and the target crowd information for the relationship mapping. The real-time continuous optimization is realized by crowd control with output information. The crowd algorithm can transform the tracking problem of moving objects to the target of the crowd optimization problem. This conversion is realized by using the crowd information of each moving target in the time domain to reset the optimization objective and the real-time optimal control conditions.

As shown in Fig. 3, the moving target prediction, optimization, and crowd optimization model can be realized by the mobile location and crowd control scheme. The moving target crowd models are extended to the control problem of the moving optimization of the mapping object according to the prediction, optimization, and correction. The model can be used to the trajectory control of moving objects and be suitable for the real-time decision of the upper control center.

Fig. 3
figure 3

Architecture of moving target crowd model

The controller of moving target crowd model is composed of crowd model and mapping model. The two submodels can be used to predict the status and position of moving targets in real time according to the moving trajectory and the moving surface. The model can provide the conditions for crowd optimization of moving objects by the objective state of different time domain.

The moving state of the moving object in the t time and the control state of the crowd control are shown in formula (5). Here, parameter L represents the crowd state transition matrix of the moving object. According to the linear feature in time domain, the output of the moving target module is O((s, l)|t). The crowd optimization control weight is φ.

$$ \left\{\begin{array}{l}O\left(\left(s,1\right)\left|t\right.\right)=\frac{L\cdot {\displaystyle \sum_{t\to T}\varphi f(t)}}{{\displaystyle \int {S}_C(t)}}\\ {}O\left(\left(1,l\right)\left|t\right.\right)=\frac{L\cdot \sqrt{{\displaystyle \sum_{t\to T}\varphi f(t)}}}{{\displaystyle \int {T}_C(t)}}\end{array}\right. $$

According to the position of the moving target, the crowd distribution of time domain objects is predicted. The output state vector of the model is used to monitor the trajectory of moving objects and the moving surfaces. The objective optimization condition is provided according to the adjustment of crowd weight and change of linear time domain.

3.2 Adaptive multi-objective optimization

The multi-objective optimization problem of moving objects can be described as:

$$ \left\{\begin{array}{l}\underset{t\in T}{ \min }f(O)=\left[\begin{array}{ccc}\hfill f\left(O\left(\left(0,0\right)\left|t\right.\right)\right)\hfill & \hfill \cdots \hfill & \hfill f\left(O\left(\left(s,l\right)\left|t\right.\right)\right)\hfill \end{array}\right]\\ {}s.t.{s}_t{(O)}_{s\to S,l\to L}\\ {}\begin{array}{cc}\hfill \hfill & \hfill {L}_t{(O)}_{s\to S,l\to L}\hfill \end{array}\end{array}\right. $$

When S C (t) = 0 and T C (i) = 0, by crowd state transfer and linear mapping, the optimization objective is mapped to the moving trajectory and the moving surface, such as formula (7).

$$ \left\{\begin{array}{l}{s}_t{(O)}_{s\to S,l\to L}\le \varphi {S}_C{(t)}_{t\to T}\\ {}{L}_t{(O)}_{s\to S,l\to L}\le \varepsilon {T}_C{(i)}_{i\to n}\end{array}\right. $$

Thus, the multi-objective optimization formula is equivalent to

$$ \left\{\begin{array}{l}\underset{t\in T}{ \min }f(O)=\left[\begin{array}{ccc}\hfill f\left(O\left(\left(0,0\right)\left|t\right.\right)\right)\hfill & \hfill \cdots \hfill & \hfill f\left(O\left(\left(s,l\right)\left|t\right.\right)\right)\hfill \end{array}\right]\\ {}s.t.\left\lfloor \varphi {S}_C{(t)}_{t\to T}\right\rfloor \\ {}\begin{array}{cc}\hfill \hfill & \hfill \left\lceil \varepsilon {T}_C{(i)}_{i\to n}\right\rceil \hfill \end{array}\end{array}\right. $$

Adaptive multi-objective optimization algorithm of crowd process is shown in Fig. 4. Algorithm procedure is described as follows:

Fig. 4
figure 4

Process of adaptive multi-objective crowd optimization algorithm

  • Step1. Select the appropriate sampling time. Determine the moving target. Speed and location of sampling are initialized randomly in an optimized range.

  • Step2. Get the surface by the moving objects in the moving process. Track of moving target is obtained. Tracing the time of moving targets. Get the total length of the moving time. Construction of three-dimensional spatial component of moving objects. Get the initial movement speed. Obtain the acceleration of moving target according to the track and speed. Initialize of the parameters of the moving surface.

  • Step3. Select the state and position of the moving surface.

  • Step4. For each moment in the moving trajectory, the distance field function is obtained according to the formulas (2) and (3). According to this function, the velocity and position of the moving target are updated, and the new moving trajectory is obtained.

  • Step5. For each data point of the moving surface, the optimization goal would be set according to the method of distance field function shown in Fig. 1.

  • Step6. According to the method of Fig. 3, based on mobile positioning and crowd control, crowd optimization model is obtained for predicting and optimizing the moving goal, as well as the crowd acquisition.

  • Step7. The real-time decision of the upper control center is supported by mobile target trajectory control from mobile crowd multiple target optimization.

  • Step8. According to formula (6), the multi-objective optimization model of moving objects is obtained.

According to Fig. 4 and formula (5), step 3 realizes the adaptive multi-objective optimization.

4 Performance evaluation

The five optimization functions are selected to describe the moving objectives. The functions F1, F2, and F3 are as shown the formula (9). The test functions F4 and F5 are shown in the formula (10). Here, the functions F1, F2, and F3 are the main points of the optimal control of the moving crowd target. The functions F4 and F5 have the characteristics of movement shown in Fig. 1. Different parameters are selected for different functions. The test parameters are shown in Table 1.

Table 1 Testing parameters
$$ \begin{array}{l}F1-F3\\ {}\left\{\begin{array}{l} \min f(O)=O{\left(s,l\right)}_t\\ {}s.t.{S}_C^{\varepsilon }=\varphi {S}_C{(t)}_{t\to T}\\ {}\begin{array}{cc}\hfill \hfill & \hfill {T}_C^{\varepsilon }=\varphi {T}_C{(i)}_{i\to n}\hfill \end{array}\end{array}\right.\end{array} $$
$$ \begin{array}{l}F4-F5\\ {}\left\{\begin{array}{l} \min f(O)=O{\left(s,l\right)}_t\\ {} \min f\left(x,y,z\right)={\displaystyle \prod_t^T{O}_{x,y,z}}\\ {}s.t.O\left(\left(1,0\right)\left|t\right.\right)={L}_1\cdot {\displaystyle \sum_{t\to T}\varphi f(t)}\\ {}\begin{array}{cc}\hfill \hfill & \hfill O\left(\left(0,1\right)\left|t\right.\right)={L}_0\cdot {\displaystyle \sum_{t\to T}\frac{\varepsilon f(t)}{{\displaystyle \int {S}_C(t)}}}\hfill \end{array}\end{array}\right.\end{array} $$

Figure 5 shows the ACO-DF (mobile adaptive crowd optimization scheme based on distance field) algorithm and the positioning error of the target optimization algorithm based on mobile search denoted as OO-MS. ACO-DF algorithm tracks the moving surface in the time domain and spatial domain. ACO-DF algorithm considers the distance field to avoid the distortion of the curved surface of the moving target. The moving object of the three-dimensional space is consistent with the arc structure of the moving surface. Positioning error is obviously less than OO-MS algorithm. In particular, the ACO-DF algorithm can effectively reduce the influence of the moving speed on the localization by modifying the surface parameters based on the corresponding change of the distance field.

Fig. 5
figure 5

Location error

Figure 6 shows the ACO-DF algorithm and OO-MS algorithm to optimize the number of iterations. Based on the cooperative control of the moving target prediction and crowd control algorithm, the ACO-DF algorithm can realize the intelligent time domain mapping control based on linear fusion. In addition, the ACO-DF algorithm obtains the state and the position of the moving target by using the crowd to control the dynamic and predictive control of the moving object. So, the number of iterations of the ACO-DF algorithm is significantly less than that of the OO-MS algorithm. ACO-DF algorithm based on trajectory information to design a real-time movement restriction and crowd optimization goal is generated for mapping relationship between target state matrix and the target group of metal information. In this way, the area of the moving surface is small, and it is helpful to improve the efficiency and accuracy of multi-objective optimization, which are shown as Fig. 7.

Fig. 6
figure 6

Optimal iteration times

Fig. 7
figure 7

Moving surface area

5 Conclusions

We present the distance field-driven adaptive mobile goals in intelligent optimization algorithms to solve the multi-objective optimization complexity and efficiency issues. First, based on the corresponding changes in the distance field, we modify the surface parameters in the airspace. In this way, the moving track and surface of the object can be obtained. Secondly, based on the curve structure of the moving track, we adaptively adjust the x axis and the y axis structure of the moving trajectory. Then, we decompose the process into three processes, which are target dynamic crowd control, crowd model algorithm control and linear time domain predictive control. The three processes are based on the cooperative control of the moving target prediction and crowd control algorithm to form a multi-objective optimization framework. Finally, the multi-objective optimization algorithm of moving objects is proposed by using the crowd model to predict the status and the position of the target. The results of the five test functions show that the proposed algorithm has higher localization accuracy, lesser iteration times, and smaller surface area than the target optimization algorithm based on mobile search.


  1. G Zhu, Z Wang, G Zhang, Research on a combined device SMES-SFCL based on multi-object optimization[J]. IEEE Trans. Appl. Supercond. 15(2), 2019–2022 (2005)

    Article  Google Scholar 

  2. J Liu, L Cao, Z Li et al., Plane-based optimization for 3D object reconstruction from single line drawings.[J]. IEEE Trans. Pattern Anal. Mach. Intell. 30(2), 315–327 (2008)

    Article  Google Scholar 

  3. APD Poz, RAB Gallis, JFCD Silva, Three-dimensional semiautomatic road extraction from a high-resolution aerial image by dynamic-programming optimization in the object space[J]. IEEE Geosci. Remote Sens. Lett. 7(4), 796–800 (2010)

    Article  Google Scholar 

  4. P Fungtammasan, T Watanabe, Grasp input optimization taking contact position and object information uncertainties into consideration[J]. IEEE Trans. Robot. 28(5), 1170–1177 (2012)

    Article  Google Scholar 

  5. J Stefanski, B Mack, B Waske, Optimization of object-based image analysis with random forests for land cover mapping[J]. Sel. Top. Appl. Earth Obs. Remote Sens. IEEE J. 6(6), 2492–2504 (2013)

    Article  Google Scholar 

  6. C Wang, Y Guo, J Zhu et al., Video object co-segmentation via subspace, clustering and quadratic pseudo-Boolean optimization in an MRF framework[J]. IEEE Trans. Multimedia 16(4), 903–916 (2014)

    Article  MathSciNet  Google Scholar 

  7. Q Wang, F Chen, W Xu et al., Object tracking with joint optimization of representation and classification[J]. IEEE Trans. Circuits Syst. Video Technol. 25(4), 638–650 (2015)

    Article  MathSciNet  Google Scholar 

  8. K Ahmadi, E Salari, Small dim object tracking using a multi objective particle swarm optimisation technique[J]. IET Image Process. 9(9), 820–826 (2015)

    Article  Google Scholar 

  9. D Conte, P Foggia, G Percannella et al., Removing object reflections in videos by global optimization[J]. IEEE Trans. Circuits Syst. Video Technol. 22(11), 1623–1633 (2012)

    Article  Google Scholar 

  10. DS Kim, K Lee, Block-coordinate Gauss–Newton optimization and constrained monotone regression for image registration in the presence of outlier objects[J]. IEEE Trans. Image Process. 17(5), 798–810 (2008)

    Article  MathSciNet  Google Scholar 

  11. DJ Yoo, Advanced projection image generation algorithm for fabrication of a tissue scaffold using volumetric distance field[J]. Int. J. Precis. Eng. Manuf. 15(10), 2117–2126 (2014)

    Article  Google Scholar 

  12. M Genctav, A Genctav, S Tari, Nonlocal via local–nonlinear via linear: a new part-coding distance field via screened Poisson equation[J]. J. Math. Imaging Vision 55(2), 242–252 (2015)

    Article  MathSciNet  MATH  Google Scholar 

  13. H Yu, J Xie, KL Ma et al., Scalable parallel distance field construction for large-scale applications[J]. IEEE Trans. Vis. Comput. Graph. 21(10), 1187–200.s (2015)

    Article  Google Scholar 

Download references


This work is supported in part by the Hunan Provincial Department of Education Scientific Research Outstanding Youth Project (14B070) and Science and Technology project of Hunan Province (2014FJ6095).

Competing interests

The authors declare that they have no competing interests.

Author information

Authors and Affiliations


Corresponding author

Correspondence to Ya-chun Tang.

Rights and permissions

Open Access This article is distributed under the terms of the Creative Commons Attribution 4.0 International License (, which permits unrestricted use, distribution, and reproduction in any medium, provided you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons license, and indicate if changes were made.

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Tang, Yc., Guo, Xb. & Yin, Xd. Mobile adaptive crowd optimization scheme based on distance field. J Embedded Systems 2016, 23 (2017).

Download citation

  • Received:

  • Accepted:

  • Published:

  • DOI: