Energy-efficient Orienteering Problem in the Presence of Ocean Currents

被引:1
|
作者
Mansfield, Ariella [1 ]
Macharet, Douglas G. [2 ]
Hsieh, M. Ani [1 ]
机构
[1] Univ Penn, GRASP Lab, Philadelphia, PA 19104 USA
[2] Univ Fed Minas Gerais, Comp Vis & Robot Lab VeRLab, Belo Horizonte, MG, Brazil
关键词
TASK ASSIGNMENT; ALGORITHM; OPTIMIZATION; VEHICLES;
D O I
10.1109/IROS47612.2022.9981818
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
In many environmental monitoring applications robots are often tasked to visit various distinct locations to make observations and/or collect specific measurements. The problem of scheduling and assigning robots to the various tasks and planning feasible paths for the robots can be posed as an Orienteering Problem (OP). In the standard OP, routing and scheduling is achieved by maximizing an objective function by visiting the most rewarding locations while respecting a limited travel budget. However, traditional formulations for such problems usually neglect some environmental features that can greatly impact the tour, e.g., flows, such as wind or ocean currents. This is of particular importance for applications in marine and atmospheric environments where vehicle motions can be significantly impacted by the environmental dynamics and the environment exerts a non-negligible force on the vehicles. In this paper, we tackle the OP in fluid environments where robots must operate in the presence of ocean and/or atmospheric currents. We introduce a novel multi-objective formulation that combines both task and path planning problems, and whose goals are to (i) maximize the collected reward, while (ii) minimizing the energy expenditure by leveraging the environmental dynamics wherever possible. We validate our strategy using simulated ocean model data to show that our approach can generate a diverse set of solutions that have an adequate compromise between both objectives.
引用
收藏
页码:10081 / 10087
页数:7
相关论文
共 50 条
  • [1] Energy-efficient Team Orienteering Problem in the Presence of Time-Varying Ocean Currents
    Mansfield, Ariella
    Macharet, Douglas G.
    Hsieh, M. Ani
    2023 IEEE/RSJ INTERNATIONAL CONFERENCE ON INTELLIGENT ROBOTS AND SYSTEMS, IROS, 2023, : 838 - 843
  • [2] VISIR-1.b: ocean surface gravity waves and currents for energy-efficient navigation
    Mannarini, Gianandrea
    Carelli, Lorenzo
    GEOSCIENTIFIC MODEL DEVELOPMENT, 2019, 12 (08) : 3449 - 3480
  • [3] An efficient evolutionary algorithm for the orienteering problem
    Kobeaga, Gorka
    Merino, Maria
    Lozano, Jose A.
    COMPUTERS & OPERATIONS RESEARCH, 2018, 90 : 42 - 59
  • [4] Energy-Efficient Communication in the Presence of Synchronization Errors
    Huang, Yu-Chih
    Niesen, Urs
    Gupta, Piyush
    2013 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY PROCEEDINGS (ISIT), 2013, : 2935 - +
  • [5] Energy-Efficient Communication in the Presence of Synchronization Errors
    Huang, Yu-Chih
    Niesen, Urs
    Gupta, Piyush
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2015, 61 (11) : 6131 - 6144
  • [6] An energy-efficient permutation flowshop scheduling problem
    Oztop, Hande
    Tasgetiren, M. Fatih
    Eliiyi, Deniz Tursel
    Pan, Quan-Ke
    Kandiller, Levent
    EXPERT SYSTEMS WITH APPLICATIONS, 2020, 150
  • [7] Energy-efficient geographic routing in the presence of localization errors
    Peng, B.
    Kemp, A. H.
    COMPUTER NETWORKS, 2011, 55 (03) : 856 - 872
  • [8] Energy-Efficient Routing in Wireless Networks in the Presence of Jamming
    Sheikholeslami, Azadeh
    Ghaderi, Majid
    Pishro-Nik, Hossein
    Goeckel, Dennis
    IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS, 2016, 15 (10) : 6828 - 6842
  • [9] Generalized Energy-Efficient Algorithms for the RFID Estimation Problem
    Li, Tao
    Wu, Samuel S.
    Chen, Shigang
    Yang, Mark C. K.
    IEEE-ACM TRANSACTIONS ON NETWORKING, 2012, 20 (06) : 1978 - 1990
  • [10] Energy-efficient dynamic circuit design in the presence of crosstalk noise
    Univ of Illinois at Urbana-Champaign, Urbana, IL, United States
    Proc Int Symp Low Power Electron Des Dig Tech Papers, (24-29):