作者: Okuda Hikari
DOI:
关键词: Parking area 、 Center (algebra and category theory) 、 Time data 、 Real-time computing 、 Computer science
摘要: PROBLEM TO BE SOLVED: To permit a passenger to arrive at the destination station desired time by showing an optimum get-on for changing from car railroad. SOLUTION: From A, current place and target also are transmitted center. The center makes search train which can Z-station as selects candidate stations B, C, D. Upon checking if any parking area is available around each station, narrows candidates calculates person be in scheduled on basis of requisite data A station. Finally meet conditions decided, answer sent car.