Skip to main content

Improved Ant Colony Algorithm in Automatic Following Luggage

  • Conference paper
  • First Online:
Cyber Security Intelligence and Analytics (CSIA 2020)

Part of the book series: Advances in Intelligent Systems and Computing ((AISC,volume 1146))

  • 1002 Accesses

Abstract

At present, many people, especially when going out to study, work, and travel, cannot do without suitcases. The luggage compartment can integrate some essential items into one space. If there is less luggage, it is more convenient to bring a suitcase out, but when there is more luggage and the suitcase is relatively large, it is a burden for the user. The heavy luggage not only consumes the user’s physical strength, but also may being overweight makes it difficult to go through security. In recent years, some suitcases that can automatically follow the user have appeared on the market, which is relatively convenient. However, there are also some problems, such as encountering obstacles that may slow down the action, slow down the user’s rhythm, and become stuck due to uneven road surfaces and other issues. The purpose of this paper is to optimize the optimal path selection of the luggage, so that the luggage can quickly find the shortest way to reach the target under complicated road conditions. This paper improves the ant colony algorithm and uses it in the luggage auto-following system. The adaptive adjustment of the volatility coefficient p is used to solve the problem of slow convergence speed and easy fall into the local optimal solution of the algorithm during operation. Lattice model uses different algorithms for the same luggage to perform experiments in the same road conditions, and calculate, record the path length and the corresponding number of iterations obtained from the experiment and compare them. Experimental results show that the improved algorithm is superior to traditional algorithms. In the improved algorithm results, the optimal path length and the corresponding number of iterations are smaller than those obtained by traditional algorithms, especially the number of iterations is much smaller than that obtained by traditional algorithms. Obviously, the improved algorithm in this paper can be used to automatically follow the luggage and enhance its performance to some extent.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 169.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 219.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Geyer, H.S., Molayi, R.S.A.: Job-employed resident imbalance and travel time in Gauteng: exploring the determinants of longer travel time. Urban Forum 29(3), 1–18 (2017)

    Google Scholar 

  2. Bongkoo, L., Agarwal, S., Hyunji, K.: Influences of travel constraints on the people with disabilities’ intention to travel: an application of Seligman’s helplessness theory. Tour. Manag. 33(3), 569–579 (2017)

    Google Scholar 

  3. Chen, X.(M.), Chen, X., Zheng, H.: Understanding network travel time reliability with on-demand ride service data. Front. Eng. Manag. 4(4), 388–398 (2017)

    Article  Google Scholar 

  4. Kroesen, M.: To what extent do e-bikes substitute travel by other modes? Evidence from the Netherlands. Transp. Res. Part D Transp. Environ. 53, 377–387 (2017)

    Article  Google Scholar 

  5. Yüksel, A.: A critique of “Response Bias” in the tourism, travel and hospitality research. Tour. Manag. 59, 376–384 (2017)

    Article  Google Scholar 

  6. Min, H., Na, C.: On the problem of solving the optimization for continuous space based on information distribution function of ant colony algorithm. IOP Conf. Ser. Earth Environ. Sci. 69(1), 012121 (2017)

    Article  Google Scholar 

  7. Yang, Q., Chen, W.N., Yu, Z., et al.: Adaptive multimodal continuous ant colony optimization. IEEE Trans. Evol. Comput. 21(2), 191–205 (2017)

    Article  MathSciNet  Google Scholar 

  8. Ma, M., Sun, C., Chen, X.: Discriminative deep belief networks with ant colony optimization for health status assessment of machine. IEEE Trans. Instrum. Meas. 66(12), 3115–3125 (2017)

    Article  Google Scholar 

  9. Moon, Y.J., Yu, H.C., Gil, J.-M.: A slave ants based ant colony optimization algorithm for task scheduling in cloud computing environments. Hum. Centric Comput. Inf. Sci. 7(1), 28 (2017)

    Article  Google Scholar 

  10. Liu, C.: Optimal design of high-rise building wiring based on ant colony optimization. Cluster Comput. (5), 1–8 (2018)

    Google Scholar 

  11. Zhou, L., Wang, B., Liu, Q.: Multi-axis DC motor controller for phased array antenna applications implemented on FPGA. High Power Laser Part. Beams 30(1) (2018)

    Google Scholar 

  12. Chung, S.-W., Shih, C.-C., Huang, C.-C.: Freehand three-dimensional ultrasound imaging of carotid artery using motion tracking technology. Ultrasonics 74, 11–20 (2017)

    Article  Google Scholar 

Download references

Acknowledgements

Youth Project Funded by Xi’an Traffic Engineering Institute: System of Self Following Trunk Based on Arduino (Program No. 19KY-37).

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Wengao Sun .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2020 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Sun, W. (2020). Improved Ant Colony Algorithm in Automatic Following Luggage. In: Xu, Z., Parizi, R., Hammoudeh, M., Loyola-González, O. (eds) Cyber Security Intelligence and Analytics. CSIA 2020. Advances in Intelligent Systems and Computing, vol 1146. Springer, Cham. https://doi.org/10.1007/978-3-030-43306-2_47

Download citation

Publish with us

Policies and ethics