Skip to main content

Energy-Conserving Risk-Aware Data Collection Using Ensemble Navigation Network

  • Conference paper
  • First Online:
Recent Trends and Future Technology in Applied Intelligence (IEA/AIE 2018)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 10868))

  • 3007 Accesses

Abstract

The Data-collection Problem (DCP) models robotic agents collecting digital data in a risky environment under energy constraints. A good solution for DCP needs a balance between safety and energy use. We develop an Ensemble Navigation Network (ENN) that consists of a Convolutional Neural Network and several heuristics to learn the priorities. Experiments show ENN has superior performance than heuristic algorithms in all environmental settings. In particular, ENN has better performance in environments with higher risks and when robots have low energy capacity.

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 89.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 119.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

Notes

  1. 1.

    Input is padded with 0 s so that the input and output are of the same size.

  2. 2.

    Reward per energy is also an average over 10,000 runs.

References

  1. Abadi, M., Agarwal, A., Barham, P., Brevdo, E., Chen, Z., Citro, C., Corrado, G.S., Davis, A., Dean, J., Devin, M., et al.: Tensorflow: Large-scale machine learning on heterogeneous distributed systems. arXiv preprint arXiv:1603.04467 (2016)

  2. Brázdil, T., Kučera, A., Novotný, P.: Optimizing the expected mean payoff in energy markov decision processes. In: Artho, C., Legay, A., Peled, D. (eds.) ATVA 2016. LNCS, vol. 9938, pp. 32–49. Springer, Cham (2016). https://doi.org/10.1007/978-3-319-46520-3_3

    Chapter  Google Scholar 

  3. Dijkstra, E.W.: A note on two problems in connexion with graphs. Numer. Math. 1(1), 269–271 (1959)

    Article  MathSciNet  Google Scholar 

  4. Erdoğan, S., Miller-Hooks, E.: A green vehicle routing problem. Transp. Res. Part E Logistics Transp. Rev. 48(1), 100–114 (2012)

    Article  Google Scholar 

  5. Hudack, J., Oh, J.: Multi-agent sensor data collection with attrition risk. In: Proceedings - The 26th International Conference on Automated Planning and Scheduling, ICAPS (2016)

    Google Scholar 

  6. Kučera, A.: Playing games with counter automata. Reachability Prob., 29–41 (2012)

    Google Scholar 

  7. Lane, T., Kaelbling, L.P.: Approaches to macro decompositions of large markov decision process planning problems. In: Intelligent Systems and Advanced Manufacturing, pp. 104–113. International Society for Optics and Photonics (2002)

    Google Scholar 

  8. Lane, T., Kaelbling, L.P.: Nearly deterministic abstractions of markov decision processes. In: AAAI/IAAI, pp. 260–266 (2002)

    Google Scholar 

  9. Mnih, V., Badia, A.P., Mirza, M., Graves, A., Lillicrap, T.P., Harley, T., Silver, D., Kavukcuoglu, K.: Asynchronous methods for deep reinforcement learning. In: International Conference on Machine Learning (2016)

    Google Scholar 

  10. Mnih, V., Kavukcuoglu, K., Silver, D., Graves, A., Antonoglou, I., Wierstra, D., Riedmiller, M.: Playing atari with deep reinforcement learning. arXiv preprint arXiv:1312.5602 (2013)

  11. Mnih, V., Kavukcuoglu, K., Silver, D., Rusu, A.A., Veness, J., Bellemare, M.G., Graves, A., Riedmiller, M., Fidjeland, A.K., Ostrovski, G., et al.: Human-level control through deep reinforcement learning. Nature 518(7540), 529–533 (2015)

    Article  Google Scholar 

  12. Puterman, M.L.: Markov Decision Processes: Discrete Stochastic Dynamic Programming. Wiley, New York (2014)

    Google Scholar 

  13. Silver, D., Huang, A., Maddison, C.J., Guez, A., Sifre, L., Van Den Driessche, G., Schrittwieser, J., Antonoglou, I., Panneershelvam, V., Lanctot, M., et al.: Mastering the game of go with deep neural networks and tree search. Nature 529(7587), 484–489 (2016)

    Article  Google Scholar 

  14. Silver, D., Schrittwieser, J., Simonyan, K., Antonoglou, I., Huang, A., Guez, A., Hubert, T., Baker, L., Lai, M., Bolton, A., et al.: Mastering the game of go without human knowledge. Nature 550(7676), 354–359 (2017)

    Article  Google Scholar 

  15. Xing, Z., Oh, J.C.: Heuristics on the data-collecting robot problem with immediate rewards. In: Baldoni, M., Chopra, A.K., Son, T.C., Hirayama, K., Torroni, P. (eds.) PRIMA 2016. LNCS (LNAI), vol. 9862, pp. 131–148. Springer, Cham (2016). https://doi.org/10.1007/978-3-319-44832-9_8

    Chapter  Google Scholar 

Download references

Acknowledgements

This research was supported in part through computational resources provided by Syracuse University and by NSF award ACI-1541396.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Zhi Xing .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2018 Springer International Publishing AG, part of Springer Nature

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Xing, Z., Oh, J.C. (2018). Energy-Conserving Risk-Aware Data Collection Using Ensemble Navigation Network. In: Mouhoub, M., Sadaoui, S., Ait Mohamed, O., Ali, M. (eds) Recent Trends and Future Technology in Applied Intelligence. IEA/AIE 2018. Lecture Notes in Computer Science(), vol 10868. Springer, Cham. https://doi.org/10.1007/978-3-319-92058-0_59

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-92058-0_59

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-92057-3

  • Online ISBN: 978-3-319-92058-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics