An Online Replanning Approach for Crop Fields Mapping with Autonomous UAVs

被引:0
作者
Albore, Alexandre [1 ,2 ]
Peyrard, Nathalie [1 ]
Sabbadin, Regis [1 ]
Teichteil-Konigsbuch, Florent [2 ]
机构
[1] INRA UR 875 MIA, Chemin Borderouge, F-31326 Castanet Tolosan, France
[2] ONERA DCSD, F-31000 Toulouse, France
来源
PROCEEDINGS OF THE TWENTY-FIFTH INTERNATIONAL CONFERENCE ON AUTOMATED PLANNING AND SCHEDULING | 2015年
关键词
D O I
暂无
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
For managing production at the scale of crop fields, maps of plant pests are used to support farmer decisions. Such maps are costly to obtain since they require intensive surveys in the field, most of the time performed by human annotators or with human-controlled Unmanned Aerial Vehicles (UAVs). In this paper, we look at the next challenge from an AI planning point of view: flying fully autonomous UAVs equipped with online sequential decision-making capabilities for pests sampling and mapping in crop fields. Following existing work, we use a Markov Random Field framework to represent knowledge about the uncertain map and its quality, in order to compute an optimised pest-sampling policy. Since this planning problem is PSPACE hard, thus too hard to be exactly solved either offline or online, we propose an approach interleaving planning and execution, inspired by recent works on fault-tolerant planning. From past observations at a given time step, we compute a full plan consisting in a sequence of observed locations and expected observations till the end of the pest-sampling phase. The plan is then applied until the number of actual observations that differ from expected ones exceeds a given threshold, which triggers a new replanning episode. Our planning method favourably compares on the problem of weed map construction against an existing greedy approach - the only one working online - while adding the advantage of being adapted to autonomous UAVs' flying time constraints.
引用
收藏
页码:259 / 267
页数:9
相关论文
共 27 条
  • [1] Albore A., 2006, P INT C AUT PLANN SC
  • [2] [Anonymous], P INT C AUT PLANN SC
  • [3] [Anonymous], 2009, ICRA WORKSH OP SOURC
  • [4] Bertoli P., 2001, P IJCAI 01 WORKSH PL
  • [5] A Reinforcement-Learning Algorithm for Sampling Design in Markov Random Fields
    Bonneau, Mathieu
    Peyrard, Nathalie
    Sabbadin, Regis
    [J]. 20TH EUROPEAN CONFERENCE ON ARTIFICIAL INTELLIGENCE (ECAI 2012), 2012, 242 : 181 - 186
  • [6] Reinforcement learning-based design of sampling policies under cost constraints in Markov random fields: Application to weed map reconstruction
    Bonneau, Mathieu
    Gaba, Sabrina
    Peyrard, Nathalie
    Sabbadin, Regis
    [J]. COMPUTATIONAL STATISTICS & DATA ANALYSIS, 2014, 72 : 30 - 44
  • [7] Replanning in Domains with Partial Information and Sensing Actions
    Brafman, Ronen I.
    Shani, Guy
    [J]. JOURNAL OF ARTIFICIAL INTELLIGENCE RESEARCH, 2012, 45 : 565 - 600
  • [8] Heuristic Search When Time Matters
    Burns, Ethan
    Rumi, Wheeler
    Do, Minh B.
    [J]. JOURNAL OF ARTIFICIAL INTELLIGENCE RESEARCH, 2013, 47 : 697 - 740
  • [9] Chanel C. P. C., 2014, P INT C AUT PLANN SC
  • [10] Chanel C. P. C., 2013, P AAAI 13