• Aucun résultat trouvé

[PDF] Top 20 Collision Avoidance for Unmanned Aircraft using Markov Decision Processes

Has 10000 "Collision Avoidance for Unmanned Aircraft using Markov Decision Processes" found on our website. Below are the top 20 most common "Collision Avoidance for Unmanned Aircraft using Markov Decision Processes".

Collision Avoidance for Unmanned Aircraft using Markov Decision Processes

Collision Avoidance for Unmanned Aircraft using Markov Decision Processes

... Before unmanned aircraft can fly safely in civil airspace, robust airborne collision avoid- ance systems must be ...a collision avoidance algorithm for every combination of ... Voir le document complet

23

Multi-agent Planning for Ship Collision Avoidance

Multi-agent Planning for Ship Collision Avoidance

... intelligent collision avoidance systems such as expert systems and decision making support systems [1, 2, 3, 4, 5, 6, ...developed for making decision on collision ... Voir le document complet

8

Aircraft collision avoidance using Monte Carlo Real-Time Belief Space Search

Aircraft collision avoidance using Monte Carlo Real-Time Belief Space Search

... planning for the current belief state. As opposed to planning for all possible situations (as is the case with offline solvers), online algorithms only consider the current situation and a small number of ... Voir le document complet

95

Dynamic collision avoidance using local cooperative airplanes decisions

Dynamic collision avoidance using local cooperative airplanes decisions

... approaches, decision and coordination are autonomously made by the entities ...nodes. For example, in [ 22 ], airplanes are represented by agents with the ability to modify their velocity and departure time ... Voir le document complet

14

Decentralized Control of Partially Observable Markov Decision Processes Using Belief Space Macro-Actions

Decentralized Control of Partially Observable Markov Decision Processes Using Belief Space Macro-Actions

... asynchronous decision-making is often needed due to stochastic action effects and the lack of perfect ...controllers for each robot would be automatically generated based on a high-level domain ...method ... Voir le document complet

9

Lightweight Verification of Markov Decision Processes with Rewards

Lightweight Verification of Markov Decision Processes with Rewards

... The Kearns algorithm is the classic ‘sparse sampling algorithm’ for large, in- finite horizon, discounted MDPs. It constructs a ‘near optimal’ scheduler piece- wise, by approximating the best action from a current ... Voir le document complet

16

Avionics systems development for small unmanned aircraft

Avionics systems development for small unmanned aircraft

... The avionics systems for two small unmanned aerial vehicles (UAVs) are considered from the point of view of hardware selection, navigation and control algorithm desig[r] ... Voir le document complet

104

Aircraft collision models

Aircraft collision models

... (All aircraft have the same probability distributions of velocity and density.) An aircraft collision model which estimates the rate of collisions between different types[r] ... Voir le document complet

98

Decentralized control of Partially Observable Markov Decision Processes using belief space macro-actions

Decentralized control of Partially Observable Markov Decision Processes using belief space macro-actions

... used for many decentralized planning problems, this domain was chosen due to its extreme ...complexity. For instance, the experiments conducted use a policy controller with 13 nodes, resulting in a policy ... Voir le document complet

9

Collision avoidance via laser rangefinding

Collision avoidance via laser rangefinding

... The sensor utilizes a short pulse waveform of approximately 2.5 nanoseconds in duration while the receiver uses advance processing technology to detect the radar ret[r] ... Voir le document complet

105

Underwater Robotic: localization with electrolocation for collision avoidance

Underwater Robotic: localization with electrolocation for collision avoidance

... electrolocation for collision avoidance Guillaume Baffet, Pol Bernard Gossiaux, Mathieu Porez and Fr´ed´eric Boyer Abstract— This paper proposes and compares two observers designed to calculate the ... Voir le document complet

7

Lexicographic refinements in stationary possibilistic Markov Decision Processes

Lexicographic refinements in stationary possibilistic Markov Decision Processes

... possibilistic Markov decision processes and proposes a value iteration algorithm that looks for policies optimal with respect to these ...non-sequential decision making under ... Voir le document complet

22

Collision Avoidance of Redundant Robotic Manipulators Using Newton’s Method

Collision Avoidance of Redundant Robotic Manipulators Using Newton’s Method

... fields for performing collision avoidance and path planning in high DOF manip- ...ulators. Using mathematical optimization, the collision avoidance problem is ...utilized ... Voir le document complet

10

3D Collision Avoidance for Digital Actors Locomotion

3D Collision Avoidance for Digital Actors Locomotion

... solution for planning the locomotion of a digital actor through a virtual environment has been presented in this ...an collision avoidance ... Voir le document complet

7

Case learning for CBR-based collision avoidance systems

Case learning for CBR-based collision avoidance systems

... methods for learning cases from historic maritime affair ...estimation for given ...situation for our evaluation task. While running ship-handling simulations using the designed encounter ... Voir le document complet

21

Constrained Markov Decision Processes with Total Expected Cost Criteria

Constrained Markov Decision Processes with Total Expected Cost Criteria

... s(β, u; x) = β(x) + X y∈X s(β, u; y) M P yx (w). see the derivation of eq 8.6 page 102 in [1]. Note that in [1], s(β, u; x) is finite for all β, u and x but eq. 8.6 in [1] holds also in our framework. Hence by ... Voir le document complet

3

Lexicographic refinements in possibilistic decision trees and finite-horizon Markov decision processes

Lexicographic refinements in possibilistic decision trees and finite-horizon Markov decision processes

... time for the six criteria (the three optimistic ones and the three pes­ simistic ...of decision nodes, which is in line with what we could ...ms for the DTs with 5461 decision ... Voir le document complet

27

A Learning Design Recommendation System Based on Markov Decision Processes

A Learning Design Recommendation System Based on Markov Decision Processes

... The learning object ݏ ᇱ is reached from ݏ after the transition ܽ ԡܶܵሺ݄ܶ݁ܽܿ݁ݎሻǡ ܶܵሺݏ ᇱ ሻԡ is a distance factor between the teacher’s teaching styles and the learning object ݏ ᇱ teaching styles. Consequently, ԡܮܵሺܷݏ݁ݎሻǡ ... Voir le document complet

9

DetH*: Approximate Hierarchical Solution of Large Markov Decision Processes

DetH*: Approximate Hierarchical Solution of Large Markov Decision Processes

... There are two important related lines of work, focusing ei- ther on factoring or on decomposition of large MDPs. Im- provements on factored MDP solvers continue to treat the MDP as a single problem, but find more compact ... Voir le document complet

9

Lexicographic refinements in possibilistic decision trees and finite-horizon Markov decision processes

Lexicographic refinements in possibilistic decision trees and finite-horizon Markov decision processes

... algorithms for finding lexico- graphic solutions to ...algorithms for possibilistic MDPs, since no unique stochastic transition function corresponds to a possibility distribution [ 42 ...possibilistic ... Voir le document complet

26

Show all 10000 documents...