Feasible and Optimal Path Planning in Strong Current Fields

This paper addresses the problem of path planning in strong current fields. In such situations, existing approaches are subject to incorrectness and incompleteness issues. That is, they may return physically infeasible paths or no path at all, even if a feasible path exists. That is why we propose h...

Full description

Saved in:
Bibliographic Details
Published inIEEE transactions on robotics Vol. 27; no. 1; pp. 89 - 98
Main Author Soulignac, Michaël
Format Journal Article
LanguageEnglish
Published New York, NY IEEE 01.02.2011
Institute of Electrical and Electronics Engineers
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subjects
Online AccessGet full text
ISSN1552-3098
1941-0468
DOI10.1109/TRO.2010.2085790

Cover

Loading…
Abstract This paper addresses the problem of path planning in strong current fields. In such situations, existing approaches are subject to incorrectness and incompleteness issues. That is, they may return physically infeasible paths or no path at all, even if a feasible path exists. That is why we propose here a new approach called the sliding wavefront expansion. This algorithm, which combine an appropriate cost function and continuous optimization techniques, guarantees the existence of a path with an arbitrary precision. The validity and the global optimality of the path are theoretically proven. Simulation results on realistic environments, which is based on actual wind charts, are also provided.
AbstractList This paper addresses the problem of path planning in strong current fields. In such situations, existing approaches are subject to incorrectness and incompleteness issues. That is, they may return physically infeasible paths or no path at all, even if a feasible path exists. That is why we propose here a new approach called the sliding wavefront expansion. This algorithm, which combine an appropriate cost function and continuous optimization techniques, guarantees the existence of a path with an arbitrary precision. The validity and the global optimality of the path are theoretically proven. Simulation results on realistic environments, which is based on actual wind charts, are also provided.
This paper addresses the problem of path planning in strong current fields. In such situations, existing approaches are subject to incorrectness and incompleteness issues. That is, they may return physically infeasible paths or no path at all, even if a feasible path exists. That is why we propose here a new approach called the sliding wavefront expansion. This algorithm, which combine an appropriate cost function and continuous optimization techniques, guarantees the existence of a path with an arbitrary precision. The validity and the global optimality of the path are theoretically proven. Simulation results on realistic environments, which is based on actual wind charts, are also provided. [PUBLICATION ABSTRACT]
Author Soulignac, Michaël
Author_xml – sequence: 1
  givenname: Michaël
  surname: Soulignac
  fullname: Soulignac, Michaël
  email: michael.soulignac@isen.fr
  organization: Inst. Super. d'Electron. et du Numerique, Lille, France
BackLink http://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&idt=23896615$$DView record in Pascal Francis
BookMark eNp9kU1LAzEQhoMoqNW74GURRC9bM8lmN8GTFKuCUPHjHLJJViPbbE3Sg__elFYPHnqaGXje-XoP0a4fvEXoBPAYAIur1-fZmOBcEcxZI_AOOgBRQYmrmu_mnDFSUiz4PjqM8RNjUglMD9D11Kro2t4WyptitkhurvriSaWP4qlX3jv_XjhfvKQw5GyyDMH6VEyd7U08Qnud6qM93sQRepvevk7uy8fZ3cPk5rHUlLNUEtEKpllDDVDams5o01JoOt7pytTWKMOEaBiHlvCmBWwBKkM70RLbMKyAjtDFuu8iDF9LG5Ocu6htn_ezwzJKXgOrQVCaycutJNQNEA6sEhk9-4d-Dsvg8x2Ss4pwnJkMnW8gFbXqu6C8dlEuQv5S-JaEclHn4Zmr15wOQ4zBdlK7pJIbfArK9RKwXJkks0lyZZLcmJSF-J_wt_cWyela4qy1fzirKaN55R9hTZvl
CODEN ITREAE
CitedBy_id crossref_primary_10_1016_j_future_2023_02_004
crossref_primary_10_1016_j_robot_2023_104410
crossref_primary_10_1080_10798587_2015_1118277
crossref_primary_10_1007_s11036_016_0778_5
crossref_primary_10_2139_ssrn_4123153
crossref_primary_10_1007_s10846_022_01589_1
crossref_primary_10_1017_S0373463315000351
crossref_primary_10_1016_j_oceaneng_2015_10_007
crossref_primary_10_1177_17298806221089777
crossref_primary_10_1016_j_oceaneng_2018_10_008
crossref_primary_10_3390_electronics10090997
crossref_primary_10_1016_j_oceaneng_2022_112829
crossref_primary_10_1177_1729881420969076
crossref_primary_10_1007_s11804_018_0034_4
crossref_primary_10_2514_1_54950
crossref_primary_10_1007_s10846_021_01533_9
crossref_primary_10_1016_j_asoc_2017_10_025
crossref_primary_10_1109_ACCESS_2019_2960859
crossref_primary_10_1016_j_oceaneng_2020_108057
crossref_primary_10_1109_TBME_2012_2236092
crossref_primary_10_1109_LRA_2017_2722541
crossref_primary_10_1016_j_oceaneng_2015_07_030
crossref_primary_10_1109_TSMCB_2012_2210212
crossref_primary_10_1109_ACCESS_2019_2922689
crossref_primary_10_3390_robotics6040028
crossref_primary_10_1016_j_oceaneng_2023_114981
crossref_primary_10_1016_j_oceaneng_2024_117910
crossref_primary_10_1007_s12555_022_0826_9
crossref_primary_10_1016_j_procs_2021_08_172
crossref_primary_10_1007_s11633_016_1004_4
crossref_primary_10_1016_j_compeleceng_2017_12_035
crossref_primary_10_1049_trit_2018_1058
crossref_primary_10_1177_0959651811428035
crossref_primary_10_1016_j_oceaneng_2023_115591
crossref_primary_10_1007_s11633_019_1204_9
crossref_primary_10_3390_en15051769
crossref_primary_10_2514_1_G001389
crossref_primary_10_3390_s17071607
crossref_primary_10_1016_j_oceaneng_2014_03_034
crossref_primary_10_3390_s25020381
crossref_primary_10_1088_1742_6596_1621_1_012015
crossref_primary_10_1016_j_oceaneng_2019_106266
crossref_primary_10_1007_s10514_024_10179_z
crossref_primary_10_3390_s22186942
crossref_primary_10_1007_s10236_016_0979_2
crossref_primary_10_1007_s11370_020_00317_8
crossref_primary_10_1016_j_future_2017_09_033
crossref_primary_10_5302_J_ICROS_2012_18_4_365
crossref_primary_10_3390_s18124167
crossref_primary_10_1177_1729881419851945
crossref_primary_10_1007_s10846_013_9870_2
crossref_primary_10_1016_j_oceaneng_2023_114393
crossref_primary_10_1109_MRA_2012_2184193
crossref_primary_10_1109_TVT_2020_3034628
crossref_primary_10_3390_jmse12122147
crossref_primary_10_1016_j_arcontrol_2018_10_012
crossref_primary_10_1109_ACCESS_2018_2888617
crossref_primary_10_2478_pomr_2019_0015
crossref_primary_10_1109_JSYST_2019_2937346
crossref_primary_10_1016_j_ins_2018_04_044
crossref_primary_10_1016_j_oceaneng_2021_108675
crossref_primary_10_1016_j_oceaneng_2018_09_016
crossref_primary_10_1109_TCDS_2017_2655539
crossref_primary_10_1049_iet_cta_2018_6125
crossref_primary_10_1007_s00500_019_04409_1
crossref_primary_10_1016_j_isatra_2018_02_003
crossref_primary_10_1109_TVT_2020_3004140
crossref_primary_10_1177_0278364914545812
crossref_primary_10_1007_s10514_017_9625_1
crossref_primary_10_3390_app9163228
crossref_primary_10_1007_s12555_022_1172_7
crossref_primary_10_1109_JOE_2015_2503498
crossref_primary_10_1002_oca_995
crossref_primary_10_2478_pomr_2019_0025
crossref_primary_10_1007_s11431_017_9198_6
crossref_primary_10_1016_j_robot_2016_03_011
Cites_doi 10.1109/ROBOT.2008.4543391
10.1109/ROBOT.2005.1570118
10.1109/TRO.2007.895057
10.1109/ROBOT.2010.5509249
10.1145/10515.10549
10.1109/ROBOT.2007.364135
10.1109/ROBOT.2010.5509298
10.1109/21.148426
10.1007/BF02592073
ContentType Journal Article
Copyright 2015 INIST-CNRS
Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) Feb 2011
Copyright_xml – notice: 2015 INIST-CNRS
– notice: Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) Feb 2011
DBID 97E
RIA
RIE
AAYXX
CITATION
IQODW
7SC
7SP
7TB
8FD
FR3
JQ2
L7M
L~C
L~D
F28
DOI 10.1109/TRO.2010.2085790
DatabaseName IEEE Xplore (IEEE)
IEEE All-Society Periodicals Package (ASPP) 1998–Present
IEEE Electronic Library (IEL)
CrossRef
Pascal-Francis
Computer and Information Systems Abstracts
Electronics & Communications Abstracts
Mechanical & Transportation Engineering Abstracts
Technology Research Database
Engineering Research Database
ProQuest Computer Science Collection
Advanced Technologies Database with Aerospace
Computer and Information Systems Abstracts – Academic
Computer and Information Systems Abstracts Professional
ANTE: Abstracts in New Technology & Engineering
DatabaseTitle CrossRef
Technology Research Database
Computer and Information Systems Abstracts – Academic
Mechanical & Transportation Engineering Abstracts
Electronics & Communications Abstracts
ProQuest Computer Science Collection
Computer and Information Systems Abstracts
Engineering Research Database
Advanced Technologies Database with Aerospace
Computer and Information Systems Abstracts Professional
ANTE: Abstracts in New Technology & Engineering
DatabaseTitleList
Technology Research Database
Technology Research Database
Technology Research Database
Database_xml – sequence: 1
  dbid: RIE
  name: IEEE Xplore Digital Library
  url: https://proxy.k.utb.cz/login?url=https://ieeexplore.ieee.org/
  sourceTypes: Publisher
DeliveryMethod fulltext_linktorsrc
Discipline Engineering
Applied Sciences
EISSN 1941-0468
EndPage 98
ExternalDocumentID 2279407041
23896615
10_1109_TRO_2010_2085790
5635349
Genre orig-research
Feature
GroupedDBID .DC
0R~
29I
4.4
5GY
5VS
6IK
97E
AAJGR
AARMG
AASAJ
AAWTH
ABAZT
ABQJQ
ABVLG
ACGFO
ACIWK
AENEX
AETIX
AGQYO
AGSQL
AHBIQ
AIBXA
AKJIK
AKQYR
ALMA_UNASSIGNED_HOLDINGS
ATWAV
BEFXN
BFFAM
BGNUA
BKEBE
BPEOZ
CS3
DU5
EBS
EJD
F5P
HZ~
H~9
IFIPE
IPLJI
JAVBF
LAI
M43
MS~
O9-
OCL
P2P
PQQKQ
RIA
RIE
RNS
VJK
AAYXX
CITATION
RIG
IQODW
7SC
7SP
7TB
8FD
FR3
JQ2
L7M
L~C
L~D
F28
ID FETCH-LOGICAL-c385t-29b95c573d133bdfdcdb317f8fc4d6edad5997581b287b10e114d3f9b2e750a13
IEDL.DBID RIE
ISSN 1552-3098
IngestDate Thu Jul 10 18:46:45 EDT 2025
Fri Jul 11 09:08:58 EDT 2025
Sun Jun 29 16:54:52 EDT 2025
Mon Jul 21 09:16:20 EDT 2025
Tue Jul 01 04:13:39 EDT 2025
Thu Apr 24 23:12:14 EDT 2025
Tue Aug 26 17:18:14 EDT 2025
IsPeerReviewed true
IsScholarly true
Issue 1
Keywords Autonomous system
Wind
Path planning
unmanned air vehicle
Modeling
Optimization
Robotics
Wavefront
currents
Unmanned aerial vehicle
Optimal trajectory
mission planning
Cost function
Optimal path
Optimal planning
Current
Submarine vehicle
Autonomous underwater vehicle
Language English
License https://ieeexplore.ieee.org/Xplorehelp/downloads/license-information/IEEE.html
CC BY 4.0
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-c385t-29b95c573d133bdfdcdb317f8fc4d6edad5997581b287b10e114d3f9b2e750a13
Notes SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
ObjectType-Article-1
ObjectType-Feature-2
content type line 23
PQID 854280493
PQPubID 23500
PageCount 10
ParticipantIDs crossref_citationtrail_10_1109_TRO_2010_2085790
crossref_primary_10_1109_TRO_2010_2085790
pascalfrancis_primary_23896615
proquest_miscellaneous_861561933
proquest_journals_854280493
ieee_primary_5635349
proquest_miscellaneous_1671281549
ProviderPackageCode CITATION
AAYXX
PublicationCentury 2000
PublicationDate 2011-02-01
PublicationDateYYYYMMDD 2011-02-01
PublicationDate_xml – month: 02
  year: 2011
  text: 2011-02-01
  day: 01
PublicationDecade 2010
PublicationPlace New York, NY
PublicationPlace_xml – name: New York, NY
– name: New York
PublicationTitle IEEE transactions on robotics
PublicationTitleAbbrev TRO
PublicationYear 2011
Publisher IEEE
Institute of Electrical and Electronics Engineers
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher_xml – name: IEEE
– name: Institute of Electrical and Electronics Engineers
– name: The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
References ref12
ref11
ref10
ref2
jarvis (ref8) 1985; 3
ref1
dorst (ref4) 0
witt (ref13) 2008
ref7
ref9
ref3
ref6
elston (ref5) 2009
References_xml – ident: ref11
  doi: 10.1109/ROBOT.2008.4543391
– start-page: 186
  year: 0
  ident: ref4
  article-title: optimal path planning by cost wave propagation in metric configuration space
  publication-title: Proc SPIE-Int Soc Opt Eng
– ident: ref7
  doi: 10.1109/ROBOT.2005.1570118
– start-page: 1
  year: 2008
  ident: ref13
  article-title: go with the flow: optimal auv path planning in coastal environments
  publication-title: Proc Australasian Conf Robot Autom
– ident: ref10
  doi: 10.1109/TRO.2007.895057
– ident: ref12
  doi: 10.1109/ROBOT.2010.5509249
– ident: ref6
  doi: 10.1145/10515.10549
– ident: ref9
  doi: 10.1109/ROBOT.2007.364135
– volume: 3
  start-page: 187
  year: 1985
  ident: ref8
  article-title: collision-free trajectory planning using the distance transforms
  publication-title: Proc Inst Mech Eng Transp Eng
– ident: ref2
  doi: 10.1109/ROBOT.2010.5509298
– start-page: 3090
  year: 2009
  ident: ref5
  article-title: the trans-pacific crossing: long range adaptive path planning for uavs through variable wind fields
  publication-title: Proc Int Conf Robot Autom
– ident: ref1
  doi: 10.1109/21.148426
– ident: ref3
  doi: 10.1007/BF02592073
SSID ssj0024903
Score 2.3365316
Snippet This paper addresses the problem of path planning in strong current fields. In such situations, existing approaches are subject to incorrectness and...
SourceID proquest
pascalfrancis
crossref
ieee
SourceType Aggregation Database
Index Database
Enrichment Source
Publisher
StartPage 89
SubjectTerms Algorithms
Applied sciences
Autonomous underwater vehicle
Charts
Collision avoidance
Computer science; control theory; systems
Computer simulation
Control theory. Systems
Cost function
Current measurement
currents
Equations
Exact sciences and technology
mission planning
Optimization
Optimization algorithms
Optimization techniques
Path planning
Precision
Robot kinematics
Robotics
Robots
Simulation
unmanned air vehicle
Wave fronts
Wavefronts
wind
Title Feasible and Optimal Path Planning in Strong Current Fields
URI https://ieeexplore.ieee.org/document/5635349
https://www.proquest.com/docview/854280493
https://www.proquest.com/docview/1671281549
https://www.proquest.com/docview/861561933
Volume 27
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
link http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwjV1ZS8QwEB7UJ33wFutFBF8Eu7vdNG2DTyIuIqwrHuBbaS4RtSvu7ou_3ple3uJbIUmbzuSYLzOZD2AvpqxzJu76ysXCpzhCX2WR852z3AbSiTCiy8n98-j0Jjy7FbdTcNDchbHWFsFntkWPhS_fDPWEjsraAndHHsppmEbgVt7Ves-rJwsWZMoo5vOOTGqXZEe2ry8HZQxXwUdJq--HLajgVKGIyGyEQnElm8W3hbnYbXoL0K_7WQaZPLQmY9XSr19SOP73RxZhvjI72VE5TpZgyubLMPchGeEKHKI1iPPj0bIsN2yAS8kTtrhAC5HVzEbsPmdXdHZ-x6q8TqxHEXCjVbjpnVwfn_oVtYKveSLGflcqKbSIuUGMqowz2ii0JFzidGgiazIjpEQoEShEVCroWIRNhjupuhZNjCzgazCTD3O7DiwyUmq04ng3Doj7KotsEKK-RWK1SFTiQbuWdqqrvONEf_GYFvijI1PUT0r6SSv9eLDftHguc278UXeFxNvUqyTrwc4nhTblaKEgwAuEB5u1htNq1o7SRCAYQ8jEPdhtSnG6kQ8ly-1wMkqDKCbfo6BPsF_qJPh-xKWcb_zcuU2YLU-mKShmC2bGLxO7jabNWO0UY_oNDSjzZQ
linkProvider IEEE
linkToHtml http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwjV1LT9wwEB4BPQCHPnioKS24Ui9IZHezjpNYPVVVV8tjAcEicbPiV1V1ySJ299Jf35m8CrRU3CLZTpwZP-bzjOcD-JRS1jmb9kPtUxFSHGGo88SH3jvuIulFnNDl5NFpMryKj67F9RIctHdhnHNl8Jnr0GPpy7dTs6Cjsq7A3ZHHchleCLqMW93W-pNZT5Y8yJRTLOQ9mTVOyZ7sji_OqiiukpGS1t97m1DJqkIxkfkMxeIrPou_luZyvxm8glHT0yrM5GdnMdcd8-tREsfn_spreFkbnuxLNVLewJIrNmD9XjrCTfiM9iDOkIljeWHZGS4mN9jiHG1E1nAbsR8Fu6TT8--szuzEBhQDN9uCq8G38ddhWJMrhIZnYh72pZbCiJRbRKnaemusRlvCZ97ENnE2t0JKBBORRkylo55D4GS5l7rv0MjII74NK8W0cG-BJVZKg3Yc76cRsV_liYti1LjInBGZzgLoNtJWps48TgQYE1UikJ5UqB9F-lG1fgLYb1vcVlk3_lN3k8Tb1qslG8DuA4W25WijIMSLRAA7jYZVPW9nKhMIxxA08QA-tqU44ciLkhduupipKEnJ-yjoE-yJOhm-H5Ep5-_-3bk9WB2ORyfq5PD0eAfWqnNqCpF5Dyvzu4X7gIbOXO-W4_s34in2rQ
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=Feasible+and+Optimal+Path+Planning+in+Strong+Current+Fields&rft.jtitle=IEEE+transactions+on+robotics&rft.au=Soulignac%2C+Michaeel&rft.date=2011-02-01&rft.issn=1552-3098&rft.eissn=1941-0468&rft.volume=27&rft.issue=1&rft.spage=89&rft.epage=98&rft_id=info:doi/10.1109%2FTRO.2010.2085790&rft.externalDBID=NO_FULL_TEXT
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=1552-3098&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=1552-3098&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=1552-3098&client=summon