Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Konuralp Yigit

dblp:116/6467 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
0since 2021 · last 2012
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 1Systems, architecture and hardware · 1

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Artificial intelligence
1 paper
Motion planning and robot control · 56% Segmentation and scene understanding · 44%

Topics — the 3 heaviest of 3, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Computer vision › Segmentation and scene understanding
level-set method
0.112012
Path planning in time dependent flow fields using level set methods · ICRA 2012
Robotics › Motion planning and robot control
path planning
0.112012
Path planning in time dependent flow fields using level set methods · ICRA 2012
Robotics › Motion planning and robot control › motion planning › multi-robot motion planning
multi-vehicle motion planning
0.012012
Path planning in time dependent flow fields using level set methods · ICRA 2012

Methods — techniques the papers use, named apart from their topics

particle tracking · 0.1level set method · 0.1
YearPublicationVenuePosition
2012 Path planning in time dependent flow fields using level set methods
abstract
We develop and illustrate an efficient but rigorous methodology that predicts the time-optimal paths of ocean vehicles in continuous dynamic flows. The goal is to best utilize or avoid currents, without limitation on these currents or on the number of vehicles. The methodology employs a new modified level set equation to evolve a front from the starting point of a vehicle until it reaches the desired goal location, combining flow advection with nominal vehicle motion. The optimal path of the vehicle is then obtained by solving a particle tracking equation backward in time. The computational cost of this method increases linearly with the number of vehicles and geometrically with spatial dimensions. The methodology is applicable to any continuous flow and in scenarios with multiple vehicles. Present illustrations consist of the crossing of a canonical uniform jet and its validation using a classic optimization solution, as well as swarm formation in more complex time varying 2D flow fields, including jets, eddies and forbidden regions.
Tapovan Lolla, Mattheus P. Ueckermann, Konuralp Yigit, Patrick J. Haley, Pierre F. J. Lermusiaux
ICRA3