DC FieldValueLanguage
dc.contributorDepartment of Industrial and Systems Engineering-
dc.creatorLee, CKM-
dc.creatorLin, B-
dc.creatorNg, KKH-
dc.creatorLv, Y-
dc.creatorTai, WC-
dc.date.accessioned2021-05-13T08:32:54Z-
dc.date.available2021-05-13T08:32:54Z-
dc.identifier.urihttp://hdl.handle.net/10397/89944-
dc.language.isoenen_US
dc.publisherElsevieren_US
dc.subjectA* algorithm with greedy best-first-searchen_US
dc.subjectBi-directional robot path layouten_US
dc.subjectConflict-detection method with time windowen_US
dc.subjectMobile robot controlen_US
dc.subjectSmart mobile robotic fulfillment systemen_US
dc.titleSmart robotic mobile fulfillment system with dynamic conflict-free strategies considering cyber-physical integrationen_US
dc.typeJournal/Magazine Articleen_US
dc.identifier.volume42-
dc.identifier.doi10.1016/j.aei.2019.100998-
dcterms.abstractSmart mobile robots are deployed to the warehouse environments to improve the efficiency, because of its characteristics of high automation and flexibility characteristics. However, the trajectory planning is a great challenge especially when a number of mobile robotics operates in the warehouse simultaneously. This paper proposes a cyber-physical system model for smart robotic warehouse to implement the workflow data collection and procedure monitor. A decoupled method is presented to find a conflict-free path for the mobile vehicles in the warehouses, after distributing destinations to mobile robots to minimize the total travel distance. The improved A* algorithm is applied to find paths from the source node to the destination node for single mobile vehicle in the domain of smart logistics. Collisions are detected by comparing the occupying time window of each mobile vehicle. Three collision avoidance strategies are developed to solve the conflicts and the candidate path with the minimal completion time is selected as the final determined route. The contribution of the paper is to propose a CPS-enabled robotic warehouse with dynamic conflict-free strategy to self-configure the path to optimize warehouse operation efficiency.-
dcterms.accessRightsembargoed access-
dcterms.bibliographicCitationAdvanced engineering informatics, Oct. 2019, v. 42, 100998-
dcterms.isPartOfAdvanced engineering informatics-
dcterms.issued2019-10-
dc.identifier.scopus2-s2.0-85073035019-
dc.identifier.eissn1474-0346-
dc.identifier.artn100998-
dc.description.validate202105 bcvc-
dc.description.oaNot applicable-
dc.identifier.FolderNumbera0768-n11-
dc.identifier.SubFormID1579-
dc.description.fundingSourceOthers-
dc.description.fundingTextITS/275/16FX,RCA-16/434,SCO-RP1-
dc.description.pubStatusEarly release-
dc.date.embargo2021.10.31en_US
Appears in Collections:Journal/Magazine Article
Access
View full-text via PolyU eLinks SFX Query
Show simple item record

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.