Abstract
In order to make restaurant services more intelligent and complete basic services, the robot’s forward path needs to be planned. The whole restaurant could be regarded as a probabilistic model and Markov decision process (MDP) can help solve this problem. This paper proposes has a more appropriate approach - Stoical shortest path (SSP), a form of MDP. SSP can update the value of the paths iteratively and compare them to find the path with the lowest cost and could instruct the shortest way for the robot.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
