Results 11 to 20 of about 47,481 (194)
RRT*-SMART: A Rapid Convergence Implementation of RRT* [PDF]
International Journal of Advanced Robotic Systems, 2013 Many sampling based algorithms have been introduced recently. Among them Rapidly Exploring Random Tree (RRT) is one of the quickest and the most efficient obstacle free path finding algorithm.
Jauwairia Nasir +6 more
doaj +2 more sources
A Bidirectional-RRT*-Connect-Assisted RRT*-Smart for a path planning algorithm [PDF]
Jurnal Ilmiah SINERGIAlthough Rapidly Exploring Random Tree Star (RRT*) has been considered to be able to achieve convergence to an optimal solution, this method has a slow convergence speed and requires an infinite amount of time to produce a truly optimal solution.
Heru Suwoyo, Yudi Hastomi, Julpri Andika
doaj +3 more sources
Real-Time Path Planning using a Simulation-Based Markov Decision Process [PDF]
, 2011 This paper introduces a novel path planning technique called MCRT which is aimed at non-deterministic, partially known, real-time domains populated with dynamically moving obstacles, such as might be found in a real-time strategy (RTS) game.
McCluskey, T.L. +3 more
core +3 more sources
Hepatology, EarlyView., 2022 Diagnostic and prognostic ability of urinary NGAL in patients with cirrhosis and AKI. Abstract Background and Aims Acute kidney injury (AKI) commonly occurs in patients with decompensated cirrhosis. Urinary neutrophil gelatinase–associated lipocalin (uNGAL) could help discriminate between different etiologies of AKI.
Carmine Gambino +14 more
wiley +1 more source
rRT-PCR results for DBS samples positive for DENV RNA.
, 2022 rRT-PCR results for DBS samples positive for DENV RNA.
Cedar Mitchell (13949331) +15 more
core +1 more source
Studi Performansi Algoritma Perencanaan Jalur diantara PRM, RRT, RRT* dan Informed-RRT [PDF]
, 2020 This paper will discuss a comparative performance review of several path planning algorithms. This study compares five well-known path planning algorithms, namely the Probabilistic Roadmap (PRM), Rapidly-exploring Random Tree (RRT), RRT* and Informed-RRT*
Nabuasa, Yelly Y +2 more
core +1 more source
Hepatology Communications, EarlyView., 2022 Abstract Cardiovascular disease is a leading complication after both liver and kidney transplantation. Factors associated with and rates of cardiovascular events (CVEs) after simultaneous liver–kidney transplant (SLKT) are unknown. This was a retrospective cohort study of adult SLKT recipients between 2002 and 2017 at six centers in six United Network ...
Jennifer Jo +19 more
wiley +1 more source
Parallelizing RRT on large-scale distributed-memory architectures [PDF]
, 2013 This paper addresses the problem of parallelizing the Rapidly-exploring Random Tree (RRT) algorithm on large-scale distributed-memory architectures, using the Message Passing Interface.
Devaurs, Didier +2 more
core +1 more source
Parallelizing RRT on distributed-memory architectures [PDF]
, 2011 This paper addresses the problem of improving the performance of the Rapidly-exploring Random Tree (RRT) algorithm by parallelizing it. For scalability reasons we do so on a distributed-memory architecture, using the message-passing paradigm.
Devaurs, Didier +5 more
core +1 more source