1 target finding. 2 example robot’s visibility region hiding region 1 cleared region 2 3 4 5 6...
Post on 20-Dec-2015
215 views
TRANSCRIPT
![Page 1: 1 Target Finding. 2 Example robot’s visibility region hiding region 1 cleared region 2 3 4 5 6 robot](https://reader030.vdocuments.net/reader030/viewer/2022032800/56649d4c5503460f94a2b2ec/html5/thumbnails/1.jpg)
1
Target Finding
![Page 2: 1 Target Finding. 2 Example robot’s visibility region hiding region 1 cleared region 2 3 4 5 6 robot](https://reader030.vdocuments.net/reader030/viewer/2022032800/56649d4c5503460f94a2b2ec/html5/thumbnails/2.jpg)
2
Example
robot’s visibilityregion
hidingregion 1
cleared region
2 3
4 5 6
robot
![Page 3: 1 Target Finding. 2 Example robot’s visibility region hiding region 1 cleared region 2 3 4 5 6 robot](https://reader030.vdocuments.net/reader030/viewer/2022032800/56649d4c5503460f94a2b2ec/html5/thumbnails/3.jpg)
3
http://robotics.stanford.edu/groups/mobots/pe.html
![Page 4: 1 Target Finding. 2 Example robot’s visibility region hiding region 1 cleared region 2 3 4 5 6 robot](https://reader030.vdocuments.net/reader030/viewer/2022032800/56649d4c5503460f94a2b2ec/html5/thumbnails/4.jpg)
4
Problem
A target is hiding in an environment cluttered with obstacles
A robot or multiple robots with vision sensor must find the target
Compute a motion strategy with minimal number of robot(s)
![Page 5: 1 Target Finding. 2 Example robot’s visibility region hiding region 1 cleared region 2 3 4 5 6 robot](https://reader030.vdocuments.net/reader030/viewer/2022032800/56649d4c5503460f94a2b2ec/html5/thumbnails/5.jpg)
5
Assumptions
Target is unpredictable and can move arbitrarily fast
Environment is polygonal Both the target and robots are
modeled as points A robot finds the target when the
straight line joining them intersects no obstacles (omni-directional vision)
![Page 6: 1 Target Finding. 2 Example robot’s visibility region hiding region 1 cleared region 2 3 4 5 6 robot](https://reader030.vdocuments.net/reader030/viewer/2022032800/56649d4c5503460f94a2b2ec/html5/thumbnails/6.jpg)
6
Does a solution always exist
for a single robot?
Hard to test:No “hole” in the workspace
Easy to test: “Hole” in the workspace
No !
![Page 7: 1 Target Finding. 2 Example robot’s visibility region hiding region 1 cleared region 2 3 4 5 6 robot](https://reader030.vdocuments.net/reader030/viewer/2022032800/56649d4c5503460f94a2b2ec/html5/thumbnails/7.jpg)
7
Effect of Geometry on the Number of Robots
Two robotsare needed
![Page 8: 1 Target Finding. 2 Example robot’s visibility region hiding region 1 cleared region 2 3 4 5 6 robot](https://reader030.vdocuments.net/reader030/viewer/2022032800/56649d4c5503460f94a2b2ec/html5/thumbnails/8.jpg)
8
http://robotics.stanford.edu/groups/mobots/pe.html
![Page 9: 1 Target Finding. 2 Example robot’s visibility region hiding region 1 cleared region 2 3 4 5 6 robot](https://reader030.vdocuments.net/reader030/viewer/2022032800/56649d4c5503460f94a2b2ec/html5/thumbnails/9.jpg)
9
Effect of Number n of EdgesMinimal number of robots N = (log n)
![Page 10: 1 Target Finding. 2 Example robot’s visibility region hiding region 1 cleared region 2 3 4 5 6 robot](https://reader030.vdocuments.net/reader030/viewer/2022032800/56649d4c5503460f94a2b2ec/html5/thumbnails/10.jpg)
10
Effect of Number h of Holes
N=Θ( h)
![Page 11: 1 Target Finding. 2 Example robot’s visibility region hiding region 1 cleared region 2 3 4 5 6 robot](https://reader030.vdocuments.net/reader030/viewer/2022032800/56649d4c5503460f94a2b2ec/html5/thumbnails/11.jpg)
11
Information State
Example of an information state = (x,y,a=1,b=1,c=0) An initial state is of the form (x,y,a=1,b=1,...,u=1) A goal state is any state of the form (x,y,a=0,b=0,...,
u=0)
(x,y)
a = 0 or 1
c = 0 or 1
b = 0 or 1
0 cleared region1 contaminated region
visibility region
obstacle edgefree edge
![Page 12: 1 Target Finding. 2 Example robot’s visibility region hiding region 1 cleared region 2 3 4 5 6 robot](https://reader030.vdocuments.net/reader030/viewer/2022032800/56649d4c5503460f94a2b2ec/html5/thumbnails/12.jpg)
12
Critical Line
a=0b=1
(x,y,a=0,b=1)
Information state is unchanged(x,y,a=0,b=1)
a=0b=1
a=0b=0
(x,y,a=0,b=0)Critical line
contaminated area
cleared area
![Page 13: 1 Target Finding. 2 Example robot’s visibility region hiding region 1 cleared region 2 3 4 5 6 robot](https://reader030.vdocuments.net/reader030/viewer/2022032800/56649d4c5503460f94a2b2ec/html5/thumbnails/13.jpg)
13
Grid-Based Discretization
Ignores critical lines Visits many “equivalent” states Many information states per grid point Potentially very inefficient
![Page 14: 1 Target Finding. 2 Example robot’s visibility region hiding region 1 cleared region 2 3 4 5 6 robot](https://reader030.vdocuments.net/reader030/viewer/2022032800/56649d4c5503460f94a2b2ec/html5/thumbnails/14.jpg)
14
Discretization into Conservative Cells
In each conservative cell, the “topology” of the visibilityregion remains constant, i.e., the robot keeps seeing the same obstacle edges
![Page 15: 1 Target Finding. 2 Example robot’s visibility region hiding region 1 cleared region 2 3 4 5 6 robot](https://reader030.vdocuments.net/reader030/viewer/2022032800/56649d4c5503460f94a2b2ec/html5/thumbnails/15.jpg)
15
Discretization into Conservative Cells
In each conservative cell, the “topology” of the visibilityregion remains constant, i.e., the robot keeps seeing the same obstacle edges
![Page 16: 1 Target Finding. 2 Example robot’s visibility region hiding region 1 cleared region 2 3 4 5 6 robot](https://reader030.vdocuments.net/reader030/viewer/2022032800/56649d4c5503460f94a2b2ec/html5/thumbnails/16.jpg)
16
Discretization into Conservative Cells
In each conservative cell, the “topology” of the visibilityregion remains constant, i.e., the robot keeps seeing the same obstacle edges
![Page 17: 1 Target Finding. 2 Example robot’s visibility region hiding region 1 cleared region 2 3 4 5 6 robot](https://reader030.vdocuments.net/reader030/viewer/2022032800/56649d4c5503460f94a2b2ec/html5/thumbnails/17.jpg)
17
![Page 18: 1 Target Finding. 2 Example robot’s visibility region hiding region 1 cleared region 2 3 4 5 6 robot](https://reader030.vdocuments.net/reader030/viewer/2022032800/56649d4c5503460f94a2b2ec/html5/thumbnails/18.jpg)
18
Search Graph {Nodes} = {Conservative Cells} X {Information
States}
Node (c,i) is connected to (c’,i’) iff:• Cells c and c’ share an edge (i.e., are adjacent)• Moving from c, with state i, into c’ yields state i’
Initial node (c,i) is such that:• c is the cell where the robot is initially located• i = (1, 1, …, 1)
Goal node is any node where the information state is (0, 0, …, 0)
Size is exponential in the number of edges
![Page 19: 1 Target Finding. 2 Example robot’s visibility region hiding region 1 cleared region 2 3 4 5 6 robot](https://reader030.vdocuments.net/reader030/viewer/2022032800/56649d4c5503460f94a2b2ec/html5/thumbnails/19.jpg)
19
Example
A
B C D
E
(C,a=1,b=1)
(D,a=1)(B,b=1)
a b
![Page 20: 1 Target Finding. 2 Example robot’s visibility region hiding region 1 cleared region 2 3 4 5 6 robot](https://reader030.vdocuments.net/reader030/viewer/2022032800/56649d4c5503460f94a2b2ec/html5/thumbnails/20.jpg)
20
A
B C D
E
(C,a=1,b=1)
(D,a=1)(B,b=1)
(E,a=1)(C,a=1,b=0)
Example
![Page 21: 1 Target Finding. 2 Example robot’s visibility region hiding region 1 cleared region 2 3 4 5 6 robot](https://reader030.vdocuments.net/reader030/viewer/2022032800/56649d4c5503460f94a2b2ec/html5/thumbnails/21.jpg)
21
A
B C D
E
(C,a=1,b=1)
(D,a=1)(B,b=1)
(E,a=1)(C,a=1,b=0)
(B,b=0) (D,a=1)
Example
![Page 22: 1 Target Finding. 2 Example robot’s visibility region hiding region 1 cleared region 2 3 4 5 6 robot](https://reader030.vdocuments.net/reader030/viewer/2022032800/56649d4c5503460f94a2b2ec/html5/thumbnails/22.jpg)
22
A
C D
E
(C,a=1,b=1)
(D,a=1)(B,b=1)
(E,a=1)(C,a=1,b=0)
(B,b=0) (D,a=1)Much smaller search tree than with grid-based discretization !
B
Example
![Page 23: 1 Target Finding. 2 Example robot’s visibility region hiding region 1 cleared region 2 3 4 5 6 robot](https://reader030.vdocuments.net/reader030/viewer/2022032800/56649d4c5503460f94a2b2ec/html5/thumbnails/23.jpg)
23
More Complex Example
1
2
3
![Page 24: 1 Target Finding. 2 Example robot’s visibility region hiding region 1 cleared region 2 3 4 5 6 robot](https://reader030.vdocuments.net/reader030/viewer/2022032800/56649d4c5503460f94a2b2ec/html5/thumbnails/24.jpg)
24
Example with Recontaminations
654
321
![Page 25: 1 Target Finding. 2 Example robot’s visibility region hiding region 1 cleared region 2 3 4 5 6 robot](https://reader030.vdocuments.net/reader030/viewer/2022032800/56649d4c5503460f94a2b2ec/html5/thumbnails/25.jpg)
25
http://robotics.stanford.edu/groups/mobots/pe.html
![Page 26: 1 Target Finding. 2 Example robot’s visibility region hiding region 1 cleared region 2 3 4 5 6 robot](https://reader030.vdocuments.net/reader030/viewer/2022032800/56649d4c5503460f94a2b2ec/html5/thumbnails/26.jpg)
26
Robot with Cone of Vision
![Page 27: 1 Target Finding. 2 Example robot’s visibility region hiding region 1 cleared region 2 3 4 5 6 robot](https://reader030.vdocuments.net/reader030/viewer/2022032800/56649d4c5503460f94a2b2ec/html5/thumbnails/27.jpg)
27
Other Topics
Dimensioned targets and robots, three-dimensional environments
Non-guaranteed strategies Concurrent model construction and
target finding Planning the escape strategy of the
target