An Improved A-Star Algorithm Considering Water Current, Traffic Separation and Berthing for Vessel Path Planning
A traditional A-Star (A*) algorithm generates an optimal path by minimizing the path cost. For a vessel, factors of path length, obstacle collision risk, traffic separation rule and manoeuvrability restriction should be all taken into account for path planning. Meanwhile, the water current also play...
Saved in:
| Published in | Applied sciences Vol. 9; no. 6; p. 1057 |
|---|---|
| Main Authors | , , , |
| Format | Journal Article |
| Language | English |
| Published |
Basel
MDPI AG
2019
|
| Subjects | |
| Online Access | Get full text |
| ISSN | 2076-3417 2076-3417 |
| DOI | 10.3390/app9061057 |
Cover
| Abstract | A traditional A-Star (A*) algorithm generates an optimal path by minimizing the path cost. For a vessel, factors of path length, obstacle collision risk, traffic separation rule and manoeuvrability restriction should be all taken into account for path planning. Meanwhile, the water current also plays an important role in voyaging and berthing for vessels. In consideration of these defects of the traditional A-Star algorithm when it is used for vessel path planning, an improved A-Star algorithm has been proposed. To be specific, the risk models of obstacles (bridge pier, moored or anchored ship, port, shore, etc.) considering currents, traffic separation, berthing, manoeuvrability restriction have been built firstly. Then, the normal path generation and the berthing path generation with the proposed improved A-Star algorithm have been represented, respectively. Moreover, the problem of combining the normal path and the berthing path has been also solved. To verify the effectiveness of the proposed A-Star path planning methods, four cases have been studied in simulation and real scenarios. The results of experiments show that the proposed A-Star path planning methods can deal with the problems denoted in this article well, and realize the trade-off between the path length and the navigation safety. |
|---|---|
| AbstractList | A traditional A-Star (A*) algorithm generates an optimal path by minimizing the path cost. For a vessel, factors of path length, obstacle collision risk, traffic separation rule and manoeuvrability restriction should be all taken into account for path planning. Meanwhile, the water current also plays an important role in voyaging and berthing for vessels. In consideration of these defects of the traditional A-Star algorithm when it is used for vessel path planning, an improved A-Star algorithm has been proposed. To be specific, the risk models of obstacles (bridge pier, moored or anchored ship, port, shore, etc.) considering currents, traffic separation, berthing, manoeuvrability restriction have been built firstly. Then, the normal path generation and the berthing path generation with the proposed improved A-Star algorithm have been represented, respectively. Moreover, the problem of combining the normal path and the berthing path has been also solved. To verify the effectiveness of the proposed A-Star path planning methods, four cases have been studied in simulation and real scenarios. The results of experiments show that the proposed A-Star path planning methods can deal with the problems denoted in this article well, and realize the trade-off between the path length and the navigation safety. [...]Szlapczynsk reported a ship route finding method with turn penalties and collision avoidance [4]; Kim et al. put forward a grid map-based path planning method with the kinematic constraint of the vessels [5]; Lyu et al. proposed a path-guided hybrid artificial potential field (PGHAPF) method to generate adaptive, collision-free and International Regulations for Preventing Collisions at Sea (COLREGS)-constrained paths in restricted waters [6,7]. [...]it is necessary to build relevant risk models to denote the impacts of these factors. [...]the current will also increase the collision risk if the current pushes the vessel to approach one of obstacles. [...]it is indispensable to consider both keeping an appropriate distance from obstacles and current influence during path planning. In this case, the maximum one will be selected as the final risk degree. [...]the final risk degree of node Nm , rom , is defined as follows: rom=maxrom,1,rom,2,…,rom,k, In Figure 2, the path is generated by the traditional A-Star algorithm, which chooses an optimal path node without considering the risk degree of the path node. 2.2. |
| Author | Liu, Chenguang Xie, Shuo Chu, Xiumin Mao, Qingzhou |
| Author_xml | – sequence: 1 givenname: Chenguang orcidid: 0000-0002-4130-1243 surname: Liu fullname: Liu, Chenguang – sequence: 2 givenname: Qingzhou orcidid: 0000-0002-7948-2828 surname: Mao fullname: Mao, Qingzhou – sequence: 3 givenname: Xiumin surname: Chu fullname: Chu, Xiumin – sequence: 4 givenname: Shuo surname: Xie fullname: Xie, Shuo |
| BookMark | eNp9kG9rFDEQhxepYK194ycI-E5dTTbZP3l5HtoeFCy06sswt5nc5dhL1klO6bc37YmKiIEhYeaZH-R5Wp2EGLCqngv-RkrN38I8a94J3vaPqtOG910tlehP_ng_qc5T2vFytJCD4KfVvAhstZ8pfkPLFvVNBmKLaRPJ5-2eLWNI3iL5sGFfICOx5YEIQ37Nbgmc8yO7wRkIso-BQbDsHVLe3uMuEvuMKeHEriFv2fUEIZTBs-qxgynh-c_7rPr04f3t8rK--nixWi6u6lF2IteqWTvope4cFw0OEtGOcig1crRaa8BOS-xGLoam507aVqnWtroMhw70Wp5Vq2OujbAzM_k90J2J4M1DI9LGAGU_TmhQrgfA3kGDXK17BW0vhASlRacaZUXJenXMOoQZ7r7DNP0KFNzcuze_3Rf6xZEuVr8eMGWziwcK5bOmkbJ4H0TbFOrlkRoppkTo_h_J_4JHnx-kZwI__WvlB3ZsopE |
| CitedBy_id | crossref_primary_10_3390_drones6100265 crossref_primary_10_1109_JSEN_2022_3168840 crossref_primary_10_1016_j_oceaneng_2021_109380 crossref_primary_10_3390_jmse12050833 crossref_primary_10_3390_s19132976 crossref_primary_10_3390_electronics9091351 crossref_primary_10_1155_2021_8847863 crossref_primary_10_3390_jmse12050717 crossref_primary_10_1016_j_oceaneng_2024_117641 crossref_primary_10_1109_TITS_2024_3352902 crossref_primary_10_1016_j_apor_2021_102995 crossref_primary_10_3390_wevj15110531 crossref_primary_10_1016_j_ijdrr_2024_104252 crossref_primary_10_3390_sym16101311 crossref_primary_10_3390_electronics11172667 crossref_primary_10_3390_sym13112213 crossref_primary_10_3390_en12193601 crossref_primary_10_3390_aerospace11050394 crossref_primary_10_1109_TCDS_2023_3237612 crossref_primary_10_3390_computation10040059 crossref_primary_10_1016_j_ijnaoe_2023_100551 crossref_primary_10_1093_jcde_qwae085 crossref_primary_10_1109_ACCESS_2023_3335912 crossref_primary_10_1109_TCDS_2022_3212062 crossref_primary_10_3390_app142311205 crossref_primary_10_1007_s00500_022_07224_3 crossref_primary_10_1016_j_neucom_2020_05_089 crossref_primary_10_2174_1872212118666230828150857 crossref_primary_10_3390_jmse11050970 crossref_primary_10_3390_jmse10050585 crossref_primary_10_1155_2020_8896386 crossref_primary_10_1016_j_oceaneng_2024_118193 crossref_primary_10_1007_s13369_021_05445_6 crossref_primary_10_1109_ACCESS_2020_3031739 crossref_primary_10_1016_j_ocecoaman_2023_106730 crossref_primary_10_3390_act12040162 crossref_primary_10_3390_app10082770 crossref_primary_10_1016_j_ocecoaman_2024_107168 crossref_primary_10_1142_S0218001422590091 crossref_primary_10_3390_jmse11061102 crossref_primary_10_1155_2021_4977041 crossref_primary_10_1371_journal_pone_0263841 crossref_primary_10_3390_jmse11020273 crossref_primary_10_1016_j_oceaneng_2022_110555 crossref_primary_10_3389_frobt_2021_739013 crossref_primary_10_3390_electronics11081192 crossref_primary_10_1016_j_oceaneng_2019_106542 crossref_primary_10_3390_machines10040244 crossref_primary_10_1016_j_oceaneng_2022_113546 crossref_primary_10_1016_j_oceaneng_2023_114595 crossref_primary_10_3390_app12063064 crossref_primary_10_3390_s22020482 crossref_primary_10_1016_j_trc_2024_104648 crossref_primary_10_1016_j_oceaneng_2024_117067 crossref_primary_10_1007_s00773_025_01048_0 crossref_primary_10_1109_JSTARS_2022_3226527 crossref_primary_10_3390_jmse12020285 crossref_primary_10_1155_2020_8896357 crossref_primary_10_3390_mining4020025 crossref_primary_10_1016_j_oceaneng_2022_112809 crossref_primary_10_1007_s41315_020_00129_0 crossref_primary_10_1016_j_oceaneng_2024_120244 crossref_primary_10_1016_j_oceaneng_2024_118249 crossref_primary_10_3390_drones9010030 crossref_primary_10_1038_s41598_022_05386_6 crossref_primary_10_1109_ACCESS_2023_3243810 crossref_primary_10_3389_fpls_2023_1101828 crossref_primary_10_1109_ACCESS_2021_3062457 crossref_primary_10_1109_ACCESS_2023_3307480 crossref_primary_10_1016_j_ijnaoe_2025_100647 crossref_primary_10_3390_jmse11071439 crossref_primary_10_3390_aerospace9120848 crossref_primary_10_3390_app9163228 crossref_primary_10_3390_app14178029 crossref_primary_10_1016_j_eswa_2023_120932 crossref_primary_10_3390_electronics13142865 crossref_primary_10_3390_machines10020071 crossref_primary_10_1016_j_jksuci_2023_101650 crossref_primary_10_1016_j_oceaneng_2022_112557 crossref_primary_10_3390_jmse12030511 crossref_primary_10_1016_j_oceaneng_2023_115649 crossref_primary_10_3390_app132011290 crossref_primary_10_1186_s13638_022_02108_4 |
| Cites_doi | 10.1007/BF01386390 10.1017/S0373463305003528 10.1016/j.oceaneng.2014.03.034 10.1109/ICIT.2015.7125590 10.1109/TSSC.1968.300136 10.1016/j.oceaneng.2015.07.030 10.1016/j.isatra.2018.02.003 10.1016/j.trb.2008.05.010 10.1017/S0373463318000796 10.1017/S0373463312000422 10.1007/s10700-008-9035-0 10.1109/ITNG.2010.53 10.1186/s13638-015-0243-3 10.5897/IJPS11.1745 10.3390/app8122592 |
| ContentType | Journal Article |
| Copyright | 2019. This work is licensed under https://creativecommons.org/licenses/by/4.0/ (the “License”). Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License. |
| Copyright_xml | – notice: 2019. This work is licensed under https://creativecommons.org/licenses/by/4.0/ (the “License”). Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License. |
| DBID | AAYXX CITATION ABUWG AFKRA AZQEC BENPR CCPQU DWQXO PHGZM PHGZT PIMPY PKEHL PQEST PQQKQ PQUKI PRINS ADTOC UNPAY DOA |
| DOI | 10.3390/app9061057 |
| DatabaseName | CrossRef ProQuest Central (Alumni) ProQuest Central UK/Ireland ProQuest Central Essentials ProQuest Central ProQuest One Community College ProQuest Central ProQuest Central Premium ProQuest One Academic Publicly Available Content Database ProQuest One Academic Middle East (New) ProQuest One Academic Eastern Edition (DO NOT USE) ProQuest One Academic ProQuest One Academic UKI Edition ProQuest Central China Unpaywall for CDI: Periodical Content Unpaywall DOAJ Directory of Open Access Journals |
| DatabaseTitle | CrossRef Publicly Available Content Database ProQuest One Academic Middle East (New) ProQuest Central Essentials ProQuest One Academic Eastern Edition ProQuest Central (Alumni Edition) ProQuest One Community College ProQuest Central China ProQuest Central ProQuest One Academic UKI Edition ProQuest Central Korea ProQuest Central (New) ProQuest One Academic ProQuest One Academic (New) |
| DatabaseTitleList | CrossRef Publicly Available Content Database |
| Database_xml | – sequence: 1 dbid: DOA name: DOAJ Directory of Open Access Journals url: https://www.doaj.org/ sourceTypes: Open Website – sequence: 2 dbid: UNPAY name: Unpaywall url: https://proxy.k.utb.cz/login?url=https://unpaywall.org/ sourceTypes: Open Access Repository – sequence: 3 dbid: BENPR name: ProQuest Central url: http://www.proquest.com/pqcentral?accountid=15518 sourceTypes: Aggregation Database |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Engineering Sciences (General) |
| EISSN | 2076-3417 |
| ExternalDocumentID | oai_doaj_org_article_e3b8ae7fa2e04b74a57113a4916424d1 10.3390/app9061057 10_3390_app9061057 |
| GroupedDBID | .4S 5VS 7XC 8CJ 8FE 8FG 8FH AADQD AAFWJ AAYXX ADBBV ADMLS AFKRA AFPKN AFZYC ALMA_UNASSIGNED_HOLDINGS APEBS ARCSS BCNDV BENPR CCPQU CITATION CZ9 D1I D1J D1K GROUPED_DOAJ IAO K6- K6V KC. KQ8 L6V LK5 LK8 M7R MODMG M~E OK1 P62 PHGZM PHGZT PIMPY PROAC TUS ABUWG AZQEC DWQXO PKEHL PQEST PQQKQ PQUKI PRINS 2XV ADTOC IGS IPNFZ ITC RIG UNPAY |
| ID | FETCH-LOGICAL-c361t-42bfa7396f012e83eedc38dc3c0ed999ae693e6c018270f3d5445d59ed986a9b3 |
| IEDL.DBID | UNPAY |
| ISSN | 2076-3417 |
| IngestDate | Tue Oct 14 18:54:53 EDT 2025 Sun Oct 26 03:15:39 EDT 2025 Mon Jun 30 11:13:38 EDT 2025 Thu Apr 24 22:58:18 EDT 2025 Thu Oct 16 04:37:41 EDT 2025 |
| IsDoiOpenAccess | true |
| IsOpenAccess | true |
| IsPeerReviewed | true |
| IsScholarly | true |
| Issue | 6 |
| Language | English |
| License | cc-by |
| LinkModel | DirectLink |
| MergedId | FETCHMERGED-LOGICAL-c361t-42bfa7396f012e83eedc38dc3c0ed999ae693e6c018270f3d5445d59ed986a9b3 |
| Notes | ObjectType-Article-1 SourceType-Scholarly Journals-1 ObjectType-Feature-2 content type line 14 |
| ORCID | 0000-0002-4130-1243 0000-0002-7948-2828 |
| OpenAccessLink | https://proxy.k.utb.cz/login?url=https://www.mdpi.com/2076-3417/9/6/1057/pdf?version=1552482504 |
| PQID | 2331388152 |
| PQPubID | 2032433 |
| ParticipantIDs | doaj_primary_oai_doaj_org_article_e3b8ae7fa2e04b74a57113a4916424d1 unpaywall_primary_10_3390_app9061057 proquest_journals_2331388152 crossref_primary_10_3390_app9061057 crossref_citationtrail_10_3390_app9061057 |
| PublicationCentury | 2000 |
| PublicationDate | 2019-00-00 |
| PublicationDateYYYYMMDD | 2019-01-01 |
| PublicationDate_xml | – year: 2019 text: 2019-00-00 |
| PublicationDecade | 2010 |
| PublicationPlace | Basel |
| PublicationPlace_xml | – name: Basel |
| PublicationTitle | Applied sciences |
| PublicationYear | 2019 |
| Publisher | MDPI AG |
| Publisher_xml | – name: MDPI AG |
| References | Ma (ref_8) 2018; 75 Kim (ref_12) 2014; 84 Bell (ref_14) 2009; 43 Szlapczynski (ref_4) 2005; 59 Lee (ref_9) 2015; 107 ref_10 Dijkstra (ref_13) 1959; 1 Rafal (ref_11) 2013; 66 Raja (ref_3) 2012; 7 ref_2 ref_19 ref_18 Wuthishuwong (ref_1) 2015; 2015 Hart (ref_15) 1968; 4 Rahman (ref_16) 2012; 45 ref_5 ref_7 ref_6 Sathyaraj (ref_17) 2008; 7 |
| References_xml | – ident: ref_5 – volume: 1 start-page: 269 year: 1959 ident: ref_13 article-title: A note on two problems in connexion with graphs publication-title: Numer. Math. doi: 10.1007/BF01386390 – volume: 59 start-page: 27 year: 2005 ident: ref_4 article-title: A new method of ship routing on raster grids, with turn penalties and collision avoidance publication-title: J. Navig. doi: 10.1017/S0373463305003528 – volume: 84 start-page: 37 year: 2014 ident: ref_12 article-title: Angular rate-constrained path planning algorithm for unmanned surface vehicles publication-title: Ocean Eng. doi: 10.1016/j.oceaneng.2014.03.034 – ident: ref_10 – ident: ref_2 doi: 10.1109/ICIT.2015.7125590 – volume: 4 start-page: 100 year: 1968 ident: ref_15 article-title: A formal basis for the heuristic determination of minimum cost paths publication-title: IEEE Trans. Syst. Sci. Cybern. doi: 10.1109/TSSC.1968.300136 – volume: 107 start-page: 118 year: 2015 ident: ref_9 article-title: Energy efficient path planning for a marine surface vehicle considering heading angle publication-title: Ocean Eng. doi: 10.1016/j.oceaneng.2015.07.030 – volume: 45 start-page: 50 year: 2012 ident: ref_16 article-title: Path planning for robotic boats in a rescue system publication-title: Int. J. Comput. Appl. – volume: 75 start-page: 137 year: 2018 ident: ref_8 article-title: Multi-objective path planning for unmanned surface vehicle with currents effects publication-title: ISA Trans. doi: 10.1016/j.isatra.2018.02.003 – volume: 43 start-page: 97 year: 2009 ident: ref_14 article-title: Hyperstar: A multi-path Astar algorithm for risk averse vehicle navigation publication-title: Transp. Res. Part B Methodol. doi: 10.1016/j.trb.2008.05.010 – ident: ref_7 doi: 10.1017/S0373463318000796 – volume: 66 start-page: 65 year: 2013 ident: ref_11 article-title: Evolutionary Sets of Safe Ship Trajectories Within Traffic Separation Schemes publication-title: J. Navig. doi: 10.1017/S0373463312000422 – volume: 7 start-page: 257 year: 2008 ident: ref_17 article-title: Multiple UAVs path planning algorithms: A comparative study publication-title: Fuzzy Optim. Decis. Mak. doi: 10.1007/s10700-008-9035-0 – ident: ref_18 doi: 10.1109/ITNG.2010.53 – ident: ref_19 – volume: 2015 start-page: 33 year: 2015 ident: ref_1 article-title: Safe trajectory planning for autonomous intersection management by using vehicle to infrastructure communication publication-title: EURASIP J. Wirel. Commun. Networking doi: 10.1186/s13638-015-0243-3 – volume: 7 start-page: 1314 year: 2012 ident: ref_3 article-title: Optimal path planning of mobile robots: A review publication-title: Int. J. Phys. Sci. doi: 10.5897/IJPS11.1745 – ident: ref_6 doi: 10.3390/app8122592 |
| SSID | ssj0000913810 |
| Score | 2.4946904 |
| Snippet | A traditional A-Star (A*) algorithm generates an optimal path by minimizing the path cost. For a vessel, factors of path length, obstacle collision risk,... [...]Szlapczynsk reported a ship route finding method with turn penalties and collision avoidance [4]; Kim et al. put forward a grid map-based path planning... |
| SourceID | doaj unpaywall proquest crossref |
| SourceType | Open Website Open Access Repository Aggregation Database Enrichment Source Index Database |
| StartPage | 1057 |
| SubjectTerms | A-Star algorithm Algorithms berthing current effect Efficiency Methods Planning Ports Product design ship path planning Vehicles |
| SummonAdditionalLinks | – databaseName: DOAJ Directory of Open Access Journals dbid: DOA link: http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwrV1NS8QwEA2yF_Ugrh-4usqAHhQspk3aJsddURZBEfy8laRJ9VC7y34g_nsnbXetIHrx0Es7hZCZ9L2Xtm8IOeIGeS2jxgtZEHo89I2nLRVeKpTQkUbCG7gfnK9vosEDv3oOnxutvtw3YZU9cDVxZ5ZpoWycqcBSrmOuwtj3meJIa3jATSl8qJANMVU-g6XvrKsqP1KGut69D5aIXdThUAOBSqP-b-xyeVaM1Me7yvMG0Fyuk7WaIUKvGlmbLNlig6w2fAM3SLtekRM4rm2jTzbJqFdAtUVgDfQ8ZJFj6OUvQ1T_r28wb8yJ98MT8ssx1M5Mp4Bw5Xwk4M5WPuDDAlRhoG_HU7c9BUhr4dFZjOdwi3wR5n2OtsjD5cX9-cCr-yl4KYv8qccDnamYyShDVLKCITymTOCRUmuQKCobSWajlKLmiGnGjDPqMaHEiyJSUrNt0iqGhd0hkDpNzQR1-oZzZhW1WWhiqrSQqdSqQ07mc5yktdm463mRJyg6XD6Sr3x0yOEidlRZbPwY1XepWkQ4W-zyBBZLUhdL8lexdEh3nuikXquTJGAMi0UgkemQo0XyfxnK7n8MZY-sIPeS1W5Ol7Sm45ndR34z1QdlKX8CPLf2ww priority: 102 providerName: Directory of Open Access Journals – databaseName: ProQuest Central dbid: BENPR link: http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwfV1Nb9QwEB2V7QE4IFpALBRkiR6ohIUTO4lzQGgXtaqQWFVAobfIXymHkF3SVIh_z8zG2S4S6iGXxImSjJ33Zhy_B3CoPPJaKTzPZJpxlSWe2yA0d9pom1skvCktcP60yE_P1ceL7GIHFuNaGPqtcvwmrj_UfumoRv42lTKRWiPcvF_94uQaRbOro4WGidYK_t1aYuwO7KakjDWB3fnx4uzzpupCKpg6EYNOqcR8n-aJS8Q0Qfi0hUxrAf9_WOfd63Zl_vw2TbMFQCcP4UFkjmw2hHoPdkK7D_e39AT3YS-O1Cv2OspJHz2C1axlQ-kgeDbjyC47Nmsu8dn6Hz_ZaNiJ57PvyDs7FhWb3jCEMdKXYF_CoA--bJlpPZuHrqeyFUO6y76R9HjDzpBHstH_6DGcnxx__XDKo88CdzJPeq5SW5tClnmNaBW0RNh0UuPmRPBIIE3ISxlyJzAXKUQtPQn4-KzEgzo3pZVPYNIu2_AUmKNcW2pBeY9SMhgR6swXwlhdutKaKRyN77hyUYScvDCaCpMRikd1E48pvNq0XQ3SG_9tNadQbVqQXPZ6x7K7rOLoq4K02oSiNmkQyhbKZEWSSKOQG6tU-WQKB2OgqziGr6qbHjeFw03wb7mVZ7df5TncQ7ZVDvWbA5j03XV4gYymty9jN_0LhqH1HA priority: 102 providerName: ProQuest |
| Title | An Improved A-Star Algorithm Considering Water Current, Traffic Separation and Berthing for Vessel Path Planning |
| URI | https://www.proquest.com/docview/2331388152 https://www.mdpi.com/2076-3417/9/6/1057/pdf?version=1552482504 https://doaj.org/article/e3b8ae7fa2e04b74a57113a4916424d1 |
| UnpaywallVersion | publishedVersion |
| Volume | 9 |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| journalDatabaseRights | – providerCode: PRVAFT databaseName: Open Access Digital Library customDbUrl: eissn: 2076-3417 dateEnd: 99991231 omitProxy: true ssIdentifier: ssj0000913810 issn: 2076-3417 databaseCode: KQ8 dateStart: 20110101 isFulltext: true titleUrlDefault: http://grweb.coalliance.org/oadl/oadl.html providerName: Colorado Alliance of Research Libraries – providerCode: PRVAON databaseName: DOAJ Directory of Open Access Journals customDbUrl: eissn: 2076-3417 dateEnd: 99991231 omitProxy: true ssIdentifier: ssj0000913810 issn: 2076-3417 databaseCode: DOA dateStart: 20110101 isFulltext: true titleUrlDefault: https://www.doaj.org/ providerName: Directory of Open Access Journals – providerCode: PRVEBS databaseName: Inspec with Full Text customDbUrl: eissn: 2076-3417 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0000913810 issn: 2076-3417 databaseCode: ADMLS dateStart: 20120901 isFulltext: true titleUrlDefault: https://www.ebsco.com/products/research-databases/inspec-full-text providerName: EBSCOhost – providerCode: PRVHPJ databaseName: ROAD: Directory of Open Access Scholarly Resources customDbUrl: eissn: 2076-3417 dateEnd: 99991231 omitProxy: true ssIdentifier: ssj0000913810 issn: 2076-3417 databaseCode: M~E dateStart: 20110101 isFulltext: true titleUrlDefault: https://road.issn.org providerName: ISSN International Centre – providerCode: PRVPQU databaseName: ProQuest Central customDbUrl: http://www.proquest.com/pqcentral?accountid=15518 eissn: 2076-3417 dateEnd: 99991231 omitProxy: true ssIdentifier: ssj0000913810 issn: 2076-3417 databaseCode: BENPR dateStart: 20110101 isFulltext: true titleUrlDefault: https://www.proquest.com/central providerName: ProQuest – providerCode: PRVPQU databaseName: ProQuest Technology Collection customDbUrl: eissn: 2076-3417 dateEnd: 99991231 omitProxy: true ssIdentifier: ssj0000913810 issn: 2076-3417 databaseCode: 8FG dateStart: 20110101 isFulltext: true titleUrlDefault: https://search.proquest.com/technologycollection1 providerName: ProQuest |
| link | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnZ3fb9MwEMdPrH0AHoANJgqjssQemERWJ3YS5wmlaGVCoqqAwniK7NgZEyGt0hQEfz3nxikFIYR4yEtylhz5x33v4nwO4Jhr1LWMai9kQejx0NeeMlR4uZBCRQoFb2B_cH41jc7n_OVFeOESbit3rBJD8avNJh1gkO3hNhuPklE0shVpR0tdPPviMkmWHsaFZXDtQT8KUYv3oD-fztIPtqJc17ZlkjKM7e034QT9F7W-aMcLbWD9vyjM6-tqKb99lWW542wmtyHrutmeMfl0um7Uaf79N4Lj_7_HHbjldChJ24mzD9dMdQA3d-iEB7Dv1v2KPHFw6pO7sEwr0iYijCaph1q1Jml5uaivmo-fSVf-E9uT96hia-L4T08JOkVLqyBvTEsbX1REVpqMTd3YJBhB8UzeWZB5SWaoSklXTekezCdnb5-fe65qg5ezyG88HqhCxiyJCvR9RjB0wjkTeOXUaJSj0kQJM1FOMbKJacG0xQHpMMGHIpKJYofQqxaVuQ8kt5E7E9RGUZwzI6kpQh1TqUSSJ0oO4KQbxSx3SHNbWaPMMLSxI579HPEBPN7aLluQxx-txnYybC0sfHtzY1FfZm4tZ4YpIU1cyMBQrmIuw9j3meSotHnAtT-Ao24qZW5HWGUBYz4TAuXSAI630-svXXnwb2YP4QZquKTNCh1Br6nX5hHqpEYNYU9MXgyhPz6bzl4PN9mGoVsgPwDGfQ-O |
| linkProvider | Unpaywall |
| linkToHtml | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwtV3BbtQwEB2V9lA4IFpALBSwRJGoRIQTO4l9qNAubbWl7aqClvYW7Ngph5Bdsqmq_hzfxnjjbLcS6q2HXBLHijz2zJtx_B7AJjeIaxk1QcyiOOBxaAJtqQhyoYRONALeyB1wPholw1P-9Tw-X4K_3VkY91tl5xNnjtqMc1cj_xQxFjIhMNx8nvwJnGqU213tJDSUl1Yw2zOKMX-w48BeX2EKN93e30F7v4-ivd2TL8PAqwwEOUvCJuCRLlTKZFKgr7aCYdDImcArp9YgfFI2kcwmOUUkntKCGUdfY2KJD0WipGbY7wNY4YxLTP5WBruj42_zKo9j3RQhbXlRGZPU7UtLjKHUxcOFSDgTDLiFclcvq4m6vlJluRDw9p7AY49USb-dWmuwZKt1eLTAX7gOa94zTMkHT1-99RQm_Yq0pQprSD9ANFuTfnmBY9n8-k06gVB8n5whzq2JZ4j6SDBsOj4L8t22fOTjiqjKkIGtG1cmIwivyQ9HdV6SY8StpNNbegan9zLiz2G5Glf2BZDc5fZMUJdncc6soraITUqVFjKXWvVgqxvjLPek5057o8ww-XH2yG7s0YN387aTlurjv60GzlTzFo6ee3ZjXF9kfrVnlmmhbFqoyFKuU67iNAyZ4ojFecRN2IONztCZ9xnT7GaG92Bzbvw7PuXl3b28hdXhydFhdrg_OngFDxHpybZ2tAHLTX1pXyOaavQbP2UJ_LzvVfIP5YIygQ |
| linkToPdf | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwtV3BbtQwEB2VIkE5IFpALBSwRJGoRFQndhL7gNCWsrQUqkrQ0luwY6c9hOySTVX11_g6ZjbJdpFQbz3kkthW5BnPvBnbbwA2pENcK7gLYhHFgYxDF1jPVZAro2xiEfBGdMH560GyeyQ_n8QnS_CnvwtDxyp7mzgz1G6cU458KxIiFEqhu9kqumMRhzuj95PfAVWQop3WvpxGqyL7_vICw7fpu70dlPXrKBp9_P5hN-gqDAS5SMImkJEtTCp0UqCd9kqgw8iFwifn3iF0Mj7Rwic5RxSe8kI4oq5xscaPKjHaChz3FtxOicWdbqmPPs3zO8S3qULeMqIKoTntSGv0npw84YIPnJUK-Aff3j2vJubywpTlgqsbPYD7HUZlw1apVmHJV2twb4G5cA1WO5swZW864urNhzAZVqxNUnjHhgHi2JoNy1OcuebsF-tLg2J_9gMRbs06bqi3DB0mMVmwb75lIh9XzFSObfu6oQQZQ2DNjonkvGSHiFhZX2npERzdyHw_huVqXPknwHKK6oXiFGFJKbzhvohdyo1VOtfWDGCzn-Ms7-jOqepGmWHYQ_LIruQxgFfztpOW5OO_rbZJVPMWRMw9ezGuT7NunWdeWGV8WpjIc2lTaeI0DIWRiMJlJF04gPVe0FlnLabZlW4PYGMu_Gt-5en1o7yEO7g2si97B_vPYAUhnm6TRuuw3NTn_jnCqMa-mOkrg583vUD-AolJMBs |
| linkToUnpaywall | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnZ1Nb9QwEIZHsD1AD0ALiIWCLNEDlXDXiR3HOaEUUVVIVJVgoZwiO3ZKRZpdZbMg-PWMN86yIIQQh1ySseTIH_POxHkGYF9Y1LWcWZrwOKEiiSw1jilaKq2MNCh4Y_-D85tTeTIVr8-T85BwW4RjlRiKX6426RiDbIrbbDrJJnLiK9JO5rZ68SVkkjw9TCjP4LoOWzJBLT6CrenpWf7RV5Qb2vZMUo6xvf8mnKH_Yt4XbXihFaz_F4V5Y9nM9bevuq43nM3xbSiGbvZnTD4fLjtzWH7_jeD4_-9xB24FHUryfuLswDXX7ML2Bp1wF3bCul-QZwFOfXAX5nlD-kSEsySnqFVbktcXs_ay-3RFhvKf2J58QBXbksB_ek7QKXpaBXnretr4rCG6seTItZ1PghEUz-S9B5nX5AxVKRmqKd2D6fGrdy9PaKjaQEsuo46K2FQ65Zms0Pc5xdEJl1zhVTJnUY5qJzPuZMkwsklZxa3HAdkkw4dK6szw-zBqZo17AKT0kTtXzEdRQnCnmasSmzJtVFZmRo_hYBjFogxIc19Zoy4wtPEjXvwc8TE8XdvOe5DHH62O_GRYW3j49urGrL0owlouHDdKu7TSsWPCpEInaRRxLVBpi1jYaAx7w1Qqwo6wKGLOI64UyqUx7K-n11-68vDfzB7BTdRwWZ8V2oNR1y7dY9RJnXkSFsMPunQMGQ |
| 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=An+Improved+A-Star+Algorithm+Considering+Water+Current%2C+Traffic+Separation+and+Berthing+for+Vessel+Path+Planning&rft.jtitle=Applied+sciences&rft.au=Chenguang+Liu&rft.au=Qingzhou+Mao&rft.au=Xiumin+Chu&rft.au=Shuo+Xie&rft.date=2019&rft.pub=MDPI+AG&rft.eissn=2076-3417&rft.volume=9&rft.issue=6&rft.spage=1057&rft_id=info:doi/10.3390%2Fapp9061057&rft.externalDBID=DOA&rft.externalDocID=oai_doaj_org_article_e3b8ae7fa2e04b74a57113a4916424d1 |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=2076-3417&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=2076-3417&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=2076-3417&client=summon |