Abstract: An application page development method includes a static page of a target application being first obtained, and then an application page including an interaction function corresponding to interaction description information being generated based on the interaction description information input by a user and the static page. In other words, the application page has a function of interacting with the user.

Abstract: The invention relates to a sampling method and system for path planning of a mobile robot in a man-machine environment, including: calculating a distance between a node and the closest obstacle on a map, simultaneously detecting a pedestrian in an environment and marking a position of the pedestrian; selecting a starting point position as a root node, and initializing a search tree; choosing a candidate node in a passable region, calculating a cumulative cost from a node to the candidate node, and choosing a node with the lowest cost as a growth node; performing collision detection on a connecting line between the growth and the candidate nodes, and determining whether collision detection succeeds; connecting the candidate node to the growth node, and determining whether the candidate node is a goal; and acquiring a node connecting line set from the root node to the goal to form a final path.

Abstract: The invention relates to a sampling method and system for path planning of a mobile robot in a man-machine environment, including: calculating a distance between a node and the closest obstacle on a map, simultaneously detecting a pedestrian in an environment and marking a position of the pedestrian; selecting a starting point position as a root node, and initializing a search tree; choosing a candidate node in a passable region, calculating a cumulative cost from a node to the candidate node, and choosing a node with the lowest cost as a growth node; performing collision detection on a connecting line between the growth and the candidate nodes, and determining whether collision detection succeeds; connecting the candidate node to the growth node, and determining whether the candidate node is a goal; and acquiring a node connecting line set from the root node to the goal to form a final path.