scholarly journals Model Checking Real-Time Properties on the Functional Layer of Autonomous Robots

Author(s):  
Mohammed Foughali ◽  
Bernard Berthomieu ◽  
Silvano Dal Zilio ◽  
Félix Ingrand ◽  
Anthony Mallet
Author(s):  
M. G. Harinarayanan Nampoothiri ◽  
P. S. Godwin Anand ◽  
Rahul Antony

2021 ◽  
Vol 20 (5s) ◽  
pp. 1-26
Author(s):  
Jinghao Sun ◽  
Nan Guan ◽  
Rongxiao Shi ◽  
Guozhen Tan ◽  
Wang Yi

Research on modeling and analysis of real-time computing systems has been done in two areas, model checking and real-time scheduling theory. In model checking, an expressive modeling formalism such as timed automata (TA) is used to model complex systems, but the analysis is typically very expensive due to state-space explosion. In real-time scheduling theory, the analysis techniques are highly efficient, but the models are often restrictive. In this paper, we aim to exploit the possibility of applying efficient analysis techniques rooted in real-time scheduling theory to analysis of real-time task systems modeled by timed automata with tasks (TAT). More specifically, we develop efficient techniques to analyze the feasibility of TAT-based task models (i.e., whether all tasks can meet their deadlines on single-processor) using demand bound functions (DBF), a widely used workload abstraction in real-time scheduling theory. Our proposed analysis method has a pseudo-polynomial time complexity if the number of clocks used to model each task is bounded by a constant, which is much lower than the exponential complexity of the traditional model-checking based analysis approach (also assuming the number of clocks is bounded by a constant). We apply dynamic programming techniques to implement the DBF-based analysis framework, and propose state space pruning techniques to accelerate the analysis process. Experimental results show that our DBF-based method can analyze a TAT system with 50 tasks within a few minutes, which significantly outperforms the state-of-the-art TAT-based schedulability analysis tool TIMES.


1994 ◽  
Vol 111 (2) ◽  
pp. 193-244 ◽  
Author(s):  
T.A. Henzinger ◽  
X. Nicollin ◽  
J. Sifakis ◽  
S. Yovine

2017 ◽  
Vol 20 (5) ◽  
pp. 547-561 ◽  
Author(s):  
Ehsan Khamespanah ◽  
Marjan Sirjani ◽  
Kirill Mechitov ◽  
Gul Agha

Agriculture ◽  
2021 ◽  
Vol 11 (10) ◽  
pp. 954
Author(s):  
Abhijeet Ravankar ◽  
Ankit A. Ravankar ◽  
Arpit Rawankar ◽  
Yohei Hoshino

In recent years, autonomous robots have extensively been used to automate several vineyard tasks. Autonomous navigation is an indispensable component of such field robots. Autonomous and safe navigation has been well studied in indoor environments and many algorithms have been proposed. However, unlike structured indoor environments, vineyards pose special challenges for robot navigation. Particularly, safe robot navigation is crucial to avoid damaging the grapes. In this regard, we propose an algorithm that enables autonomous and safe robot navigation in vineyards. The proposed algorithm relies on data from a Lidar sensor and does not require a GPS. In addition, the proposed algorithm can avoid dynamic obstacles in the vineyard while smoothing the robot’s trajectories. The curvature of the trajectories can be controlled, keeping a safe distance from both the crop and the dynamic obstacles. We have tested the algorithm in both a simulation and with robots in an actual vineyard. The results show that the robot can safely navigate the lanes of the vineyard and smoothly avoid dynamic obstacles such as moving people without abruptly stopping or executing sharp turns. The algorithm performs in real-time and can easily be integrated into robots deployed in vineyards.


2017 ◽  
Vol 70 ◽  
pp. 422-435 ◽  
Author(s):  
Ángel Manuel Guerrero-Higueras ◽  
Noemí DeCastro-García ◽  
Francisco Javier Rodríguez-Lera ◽  
Vicente Matellán

2001 ◽  
pp. 161-168
Author(s):  
Béatrice Bérard ◽  
Michel Bidoit ◽  
Alain Finkel ◽  
François Laroussinie ◽  
Antoine Petit ◽  
...  

Sign in / Sign up

Export Citation Format

Share Document