Model-checking precision agriculture logistics: the case of the differential harvest

Saddem-yagoubi, Rim; Naud, Olivier; Godary-Dejean, Karen; Crestani, Didier

doi:10.1007/s10626-020-00313-1

Cited by 4 publications

(6 citation statements)

References 32 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…First, the influence of the Rmin parameter on the solutions is studied. Then, the influence of the specific constraint alternate harvesting, which was present in the models provided [8,20], is studied. Then, the benefits of using the notion of limiting rows are evaluated with regards to solving performance using VRPSolver model.…”

Section: Numerical Resultsmentioning

confidence: 99%

“…This technique allowed to find an optimal solution on vineyards with up to 12 rows in few minutes. These authors later enhanced their method, allowing them to find a optimal solution for instances with up to 14 rows [20] with a limited usage of memory.…”

Section: Related Workmentioning

confidence: 99%

“…Similarly to what was done in [8,20,24], the vine data set resulting from data of a real vine field was decomposed into a set of smaller vine data sets containing consecutive rows from the real data. The instances based on these generated yet realistic field data are denoted here G-instances.…”

Section: Description Of Data Setsmentioning

confidence: 99%

“…We will give a brief description of the problem. For more details, one may find previous work on the same problem [8,20,24].…”

mentioning

confidence: 99%

See 3 more Smart Citations

Using VRPSolver to efficiently solve the Differential Harvest Problem

Volte¹,

Bourreau²,

Giroudeau³

et al. 2023

Computers & Operations Research

Self Cite

View full text Add to dashboard Cite

Section: Numerical Resultsmentioning

confidence: 99%

Section: Related Workmentioning

confidence: 99%

Section: Description Of Data Setsmentioning

confidence: 99%

“…We will give a brief description of the problem. For more details, one may find previous work on the same problem [8,20,24].…”

mentioning

confidence: 99%

See 2 more Smart Citations

Using VRPSolver to efficiently solve the Differential Harvest Problem

Volte¹,

Bourreau²,

Giroudeau³

et al. 2023

Computers & Operations Research

Self Cite

View full text Add to dashboard Cite

“…Applications of PTA and UPPAAL CORA are several and from a variety of areas [14], e.g. power optimization of dataflow applications [2], battery scheduling [27], planning of nano-satelites [23,30], grape harvest logistic [33], programmable logic controllers [35], smart grids [21], service oriented systems [17], and optimal multicore mapping of spreadsheets [11] to mention a few.…”

Section: Introductionmentioning

confidence: 99%

Monte Carlo Tree Search for Priced Timed Automata

Jensen

Kiviriga

Larsen

et al. 2022

Quantitative Evaluation of Systems

View full text Add to dashboard Cite

Priced timed automata (PTA) were introduced in the early 2000s to allow for generic modelling of resource-consumption problems for systems with real-time constraints. Optimal schedules for allocation of resources may here be recast as optimal reachability problems. In the setting of PTA this problem has been shown decidable and efficient symbolic reachability algorithms have been developed. Moreover, PTA has been successfully applied in a variety of applications. Still, we believe that using techniques from the planning community may provide further improvements. Thus, in this paper we consider exploiting Monte Carlo Tree Search (MCTS), adapting it to problems formulated as PTA reachability problems. We evaluate our approach on a large benchmark set of PTAs modelling either Task graph or Job-shop scheduling problems. We discuss and implement different complete and incomplete exploration policies and study their performance on the benchmark. In addition, we experiment with both wellestablished and our novel MTCS-based optimizations of PTA and study their impact. We compare our method to the existing symbolic optimal reachability engines for PTAs and demonstrate that our method (1) finds near-optimal plans, and (2) can construct plans for problems infeasible to solve with existing symbolic planners for PTA.

show abstract

A comprehensive survey of UPPAAL‐assisted formal modeling and verification

Zhou,

Zhao,

Zhang

et al. 2024

Softw Pract Exp

View full text Add to dashboard Cite

UPPAAL is a formal modeling and verification tool based on timed automata, capable of effectively analyzing real‐time software and hardware systems. In this article, we investigate research on UPPAAL‐assisted formal modeling and verification. First, we propose four research questions considering tool characteristics, modeling methods, verification means and application domains. Then, the state‐of‐the‐art methods for model specification and verification in UPPAAL are discussed, involving model transformation, model repair, property specification, as well as verification and testing methods. Next, typical application cases of formal modeling and verification assisted by UPPAAL are analyzed, spanning across domains such as network protocol, multi‐agent system, cyber‐physical system, rail traffic and aerospace systems, cloud and edge computing systems, as well as biological and medical systems. Finally, we address the four proposed questions based on our survey and outline future research directions. By responding to these questions, we aim to provide summaries and insights into potential avenues for further exploration in this field.

show abstract

Model-checking precision agriculture logistics: the case of the differential harvest

Cited by 4 publications

References 32 publications

Using VRPSolver to efficiently solve the Differential Harvest Problem

Using VRPSolver to efficiently solve the Differential Harvest Problem

Monte Carlo Tree Search for Priced Timed Automata

A comprehensive survey of UPPAAL‐assisted formal modeling and verification

Contact Info

Product

Resources

About