{"_buckets": {"deposit": "4efa3944-0af2-4541-9a1a-499942b852b9"}, "_deposit": {"created_by": 71, "id": "6931", "owner": "71", "owners": [71], "owners_ext": {"displayname": "Kay_Thwe", "username": "kay_thwe"}, "pid": {"revision_id": 0, "type": "depid", "value": "6931"}, "status": "published"}, "_oai": {"id": "oai:meral.edu.mm:recid/00006931", "sets": ["user-miit"]}, "communities": ["miit"], "item_1583103067471": {"attribute_name": "Title", "attribute_value_mlt": [{"subitem_1551255647225": "Newton\u0027s Divided Difference Interpolation to Robot Path Planning for Overcoming Obstacle", "subitem_1551255648112": "en"}]}, "item_1583103085720": {"attribute_name": "Description", "attribute_value_mlt": [{"interim": "The main contribution of this paper is generating robot path planning for\novercoming an obstacle from mathematical point of view. The interpolation method applied for\nthis goal is Newton’s divided difference interpolation. Firstly, the kinematic constraints are\nformulated with adjusting the obstacle constraints. Then path planning for overcoming obstacle\nof biped robot is generated by using the propose interpolation method. Matlab figures are used\nto verify the numerical resulting polynomials. Demonstration results show good performance of\nthe propose method, where the biped can overcome an 15 × 10 inch obstacle in the sagittal\nplane without colliding with it."}]}, "item_1583103108160": {"attribute_name": "Keywords", "attribute_value_mlt": [{"interim": "Newton’s divided difference interpolation, Obstacle, Overcoming, Robot Path Planning"}]}, "item_1583103120197": {"attribute_name": "Files", "attribute_type": "file", "attribute_value_mlt": [{"accessrole": "open_access", "date": [{"dateType": "Available", "dateValue": "2020-12-18"}], "displaytype": "preview", "download_preview_message": "", "file_order": 0, "filename": "Newton\u0027s Divided Difference Interpolation to Robot Path Planning for Overcoming Obstacle.pdf", "filesize": [{"value": "1.5 MB"}], "format": "application/pdf", "future_date_message": "", "is_thumbnail": false, "licensetype": "license_0", "mimetype": "application/pdf", "size": 1500000.0, "url": {"url": "https://meral.edu.mm/record/6931/files/Newton\u0027s Divided Difference Interpolation to Robot Path Planning for Overcoming Obstacle.pdf"}, "version_id": "928e75c2-f793-4dba-a70d-8e02e24c9f8d"}]}, "item_1583103131163": {"attribute_name": "Journal articles", "attribute_value_mlt": [{"subitem_issue": "No.2", "subitem_journal_title": "Engineering Technology and Science Journal, tukly", "subitem_pages": "224-229", "subitem_volume": "Vol.2"}]}, "item_1583105942107": {"attribute_name": "Authors", "attribute_value_mlt": [{"subitem_authors": [{"subitem_authors_fullname": "Aye Aye Thant"}]}]}, "item_1583108359239": {"attribute_name": "Upload type", "attribute_value_mlt": [{"interim": "Publication"}]}, "item_1583108428133": {"attribute_name": "Publication type", "attribute_value_mlt": [{"interim": "Journal article"}]}, "item_1583159729339": {"attribute_name": "Publication date", "attribute_value": "2020-06-11"}, "item_title": "Newton\u0027s Divided Difference Interpolation to Robot Path Planning for Overcoming Obstacle", "item_type_id": "21", "owner": "71", "path": ["1582963674932", "1597397085335"], "permalink_uri": "http://hdl.handle.net/20.500.12678/0000006931", "pubdate": {"attribute_name": "Deposited date", "attribute_value": "2020-12-18"}, "publish_date": "2020-12-18", "publish_status": "0", "recid": "6931", "relation": {}, "relation_version_is_last": true, "title": ["Newton\u0027s Divided Difference Interpolation to Robot Path Planning for Overcoming Obstacle"], "weko_shared_id": -1}