Log in
Language:

MERAL Myanmar Education Research and Learning Portal

  • Top
  • Universities
  • Ranking
To
lat lon distance
To

Field does not validate



Index Link

Index Tree

Please input email address.

WEKO

One fine body…

WEKO

One fine body…

Item

{"_buckets": {"deposit": "878adcff-d2ad-46bd-8a7a-4151e7617c8d"}, "_deposit": {"id": "4777", "owners": [], "pid": {"revision_id": 0, "type": "recid", "value": "4777"}, "status": "published"}, "_oai": {"id": "oai:meral.edu.mm:recid/4777", "sets": ["user-ucsy"]}, "communities": ["ucsy"], "item_1583103067471": {"attribute_name": "Title", "attribute_value_mlt": [{"subitem_1551255647225": "Finding the shortest smooth path in variable size using improved A* algorithm on grid-based receptor model", "subitem_1551255648112": "en"}]}, "item_1583103085720": {"attribute_name": "Description", "attribute_value_mlt": [{"interim": "This paper presents a method based on receptor model for finding the shortest smooth path in variable size with safety margin, where clothoid curvature is used for smoothing path. The method modifies the results of grid-based A∗ algorithm and tries to push the given path away from obstacles and makes a smooth path between two specific points in 2D and 3D space. The optimized smooth path which we got in this study will be used as the main control line for designing canal surface for further study."}]}, "item_1583103108160": {"attribute_name": "Keywords", "attribute_value_mlt": [{"interim": "Pathfinding"}, {"interim": "receptor geometrical models"}, {"interim": "А* algorithm"}, {"interim": "designing automation system"}, {"interim": "applied geometry"}]}, "item_1583103120197": {"attribute_name": "Files", "attribute_type": "file", "attribute_value": []}, "item_1583103131163": {"attribute_name": "Journal articles", "attribute_value_mlt": [{"subitem_issue": "", "subitem_journal_title": "Eleventh International Conference On Computer Applications (ICCA 2013)", "subitem_pages": "", "subitem_volume": ""}]}, "item_1583103147082": {"attribute_name": "Conference papers", "attribute_value_mlt": [{"subitem_acronym": "", "subitem_c_date": "", "subitem_conference_title": "", "subitem_part": "", "subitem_place": "", "subitem_session": "", "subitem_website": ""}]}, "item_1583103211336": {"attribute_name": "Books/reports/chapters", "attribute_value_mlt": [{"subitem_book_title": "", "subitem_isbn": "", "subitem_pages": "", "subitem_place": "", "subitem_publisher": ""}]}, "item_1583103233624": {"attribute_name": "Thesis/dissertations", "attribute_value_mlt": [{"subitem_awarding_university": "", "subitem_supervisor(s)": [{"subitem_supervisor": ""}]}]}, "item_1583105942107": {"attribute_name": "Authors", "attribute_value_mlt": [{"subitem_authors": [{"subitem_authors_fullname": "Htun, Nyi Nyi"}]}]}, "item_1583108359239": {"attribute_name": "Upload type", "attribute_value_mlt": [{"interim": "Publication"}]}, "item_1583108428133": {"attribute_name": "Publication type", "attribute_value_mlt": [{"interim": "Article"}]}, "item_1583159729339": {"attribute_name": "Publication date", "attribute_value": "2013-02-26"}, "item_1583159847033": {"attribute_name": "Identifier", "attribute_value": "http://onlineresource.ucsy.edu.mm/handle/123456789/667"}, "item_title": "Finding the shortest smooth path in variable size using improved A* algorithm on grid-based receptor model", "item_type_id": "21", "owner": "1", "path": ["1597824273898"], "permalink_uri": "http://hdl.handle.net/20.500.12678/0000004777", "pubdate": {"attribute_name": "Deposited date", "attribute_value": "2019-07-11"}, "publish_date": "2019-07-11", "publish_status": "0", "recid": "4777", "relation": {}, "relation_version_is_last": true, "title": ["Finding the shortest smooth path in variable size using improved A* algorithm on grid-based receptor model"], "weko_shared_id": -1}
  1. University of Computer Studies, Yangon
  2. Conferences

Finding the shortest smooth path in variable size using improved A* algorithm on grid-based receptor model

http://hdl.handle.net/20.500.12678/0000004777
http://hdl.handle.net/20.500.12678/0000004777
fd8e03ab-18f3-4771-8f0d-73aaad7e8385
878adcff-d2ad-46bd-8a7a-4151e7617c8d
Publication type
Article
Upload type
Publication
Title
Title Finding the shortest smooth path in variable size using improved A* algorithm on grid-based receptor model
Language en
Publication date 2013-02-26
Authors
Htun, Nyi Nyi
Description
This paper presents a method based on receptor model for finding the shortest smooth path in variable size with safety margin, where clothoid curvature is used for smoothing path. The method modifies the results of grid-based A∗ algorithm and tries to push the given path away from obstacles and makes a smooth path between two specific points in 2D and 3D space. The optimized smooth path which we got in this study will be used as the main control line for designing canal surface for further study.
Keywords
Pathfinding, receptor geometrical models, А* algorithm, designing automation system, applied geometry
Identifier http://onlineresource.ucsy.edu.mm/handle/123456789/667
Journal articles
Eleventh International Conference On Computer Applications (ICCA 2013)
Conference papers
Books/reports/chapters
Thesis/dissertations
Back
0
0
views
downloads
See details
Views Downloads

Versions

Ver.1 2020-09-01 15:20:59.078075
Show All versions

Share

Mendeley Twitter Facebook Print Addthis

Export

OAI-PMH
  • OAI-PMH DublinCore
Other Formats
  • JSON

Confirm


Back to MERAL


Back to MERAL