scholarly journals Path Planning for Autonomous Articulated Vehicle Based on Improved Goal-Directed Rapid-Exploring Random Tree

2020 ◽  
Vol 2020 ◽  
pp. 1-14
Author(s):  
Tong Xu ◽  
Yang Xu ◽  
Dong Wang ◽  
Siwei Chen ◽  
Weigong Zhang ◽  
...  
Keyword(s):  
Task Complexity ◽  
Autonomous Driving ◽  
Random Tree ◽  
Simulation Experiments ◽  
Articulated Vehicle ◽  
Steering Characteristics ◽  
Node Search ◽  
Feasible Path ◽  
Key Nodes ◽  
And Task

The special steering characteristics and task complexity of autonomous articulated vehicle (AAV) make it often require multiple forward and backward movements during autonomous driving. In this paper, we present a simple yet effective method, named head correction with fixed wheel position (HC-FWP), for the demand of multiple forward and backward movements. The goal-directed rapid-exploring random tree (GDRRT) algorithm is first used to search for a feasible path in the obstacle map, and then, the farthest node search (FNS) algorithm is applied to obtain a series of key nodes, on which HC-FWP is used to correct AAV heading angles. Simulation experiments with Dynapac CC6200 articulated road roller parameters show that the proposed improved goal-directed rapid-exploring random tree (IGDRRT), consisting of GDRRT, FNS, and HC-FWP, can search a feasible path on maps that require the AAV to move back and forth.

Motivational arousal and task complexity.

1970 ◽  
Vol 83 (2, Pt.1) ◽  
pp. 329-330 ◽  
Author(s):  
Peter Suedfeld ◽  
P. Bruce Landon
Keyword(s):  
Task Complexity ◽  
And Task

Information processing rates and task complexity.

1970 ◽  
Vol 83 (1, Pt.1) ◽  
pp. 131-135 ◽  
Author(s):  
Richard W. Olshavsky ◽  
Lee W. Gregg
Keyword(s):  
Information Processing ◽  
Task Complexity ◽  
And Task

Research Note: The Interactions Among Stress, Vigilance, and Task Complexity

1975 ◽  
Vol 17 (1) ◽  
pp. 106-109 ◽  
Author(s):  
Robert S. Kennedy ◽  
Xenia B. Coulter
Keyword(s):  
Task Complexity ◽  
Vigilance Task ◽  
Research Note ◽  
Stressed Condition ◽  
Complex Task ◽  
Large Group ◽  
Flight Students ◽  
Better Than ◽  
Threat Of Shock ◽  
And Task

A simple (one-channel) or a complex (three-channel) vigilance task was administered with or without threat of shock to a large group of flight students. It was found that a larger absolute decrement was obtained in the complex task, but the relative decrements were equivalent for both. One-channel monitoring was better overall than three-channel monitoring in the non-stressed condition. Stressed subjects performed better than nonstressed, and this enhancement was greater for three-channel monitoring.

Investigating the influences of social overload and task complexity on user engagement decrease

2018 ◽  
Vol 31 (15-16) ◽  
pp. 1774-1787 ◽  
Author(s):  
Xin Zhang ◽  
Xiao-yan Ding ◽  
Gao-shan Wang ◽  
Liang Ma
Keyword(s):  
Task Complexity ◽  
User Engagement ◽  
And Task

P3 topographical change with task familiarization and task complexity

2001 ◽  
Vol 12 (3) ◽  
pp. 451-457 ◽  
Author(s):  
Sidney J Segalowitz ◽  
Amanda J Wintink ◽  
Linda J Cudmore
Keyword(s):  
Task Complexity ◽  
And Task

scholarly journals Random Walk Based Key Nodes Discovery in Opportunistic Networks

2016 ◽  
Vol 12 (03) ◽  
pp. 28
Author(s):  
Qin Qin ◽  
Yong-qiang He
Keyword(s):  
Random Walk ◽  
Binary Tree ◽  
Opportunistic Networks ◽  
Communication Cost ◽  
Simulation Experiments ◽  
Efficiency And Effectiveness ◽  
Iteration Number ◽  
Key Nodes

In opportunistic networks, temporary nodes choose neighbor nodes to forward messages while communicating. However, traditional forward mechanisms don’t take the importance of nodes into consideration while forwarding. In this paper, we assume that each node has a status indicating its importance, and temporary nodes choose the most important neighbors to forward messages. While discovering important neighbors, we propose a binary tree random walk based algorithm. We analyze the iteration number and communication cost of the proposed algorithm, and they are much less than related works. The simulation experiments validate the efficiency and effectiveness of the proposed algorithm.

Sign in / Sign up

Export Citation Format

Share Document