Kinematics - PowerPoint PPT Presentation

1 / 40
About This Presentation
Title:

Kinematics

Description:

Alternatively: Paint T with two colors (red & blue) s.t. any blue (red) point is ... Given Terrain (T), view point (vp), and fixed angle (a=A): while(int i=0;i 360) ... – PowerPoint PPT presentation

Number of Views:65
Avg rating:3.0/5.0
Slides: 41
Provided by: eyal64
Category:

less

Transcript and Presenter's Notes

Title: Kinematics


1
Computational Geometry Performance Problems with
respect to GPGPU

2D 3D 4D 6D 10D
Kinematics Computational Geometry Ariel
University Center
1
2
Agenda
  • Who are we KCG lab AUC
  • Radio Frequency Motivation
  • 2D Radio Map Compression
  • 3D Ray Tracing
  • Volumetric Compression MRI, FMRI
  • Robot Configuration Space (6D-10D)
  • Open issue Gaussian physical simulations serial
    Fortran simulation challenge.

KCG lab Ariel University Center
2
3
Who are we - (KCG)
  • KCG lab - Ariel University Center
  • Founded 2008 Boaz Ben-Moshe Nir Shvalb
  • 10 undergraduate students, 7 graduate, Postdoc
  • 6 founded projects Magnet, Mafat
  • Simulation, Computational Geometry, Topology,
    Robotis, Optimization
  • http//www.ariel.ac.il/projects/kcg/

KCG lab Ariel University Center
3
4
RF planning Motivation
  • Radio elements
  • Client
  • Base Station
  • Network
  • Microwave - LOS
  • Satellite
  • Cable

5
  • Goal design an optimal network
  • Problems of interest
  • Locating Base Stations
  • Frequency Assignment
  • Connectivity

6
  • Problems of interest
  • Locating Base Stations
  • Guarding like.
  • Complex objective function.
  • Frequency Assignment
  • Connectivity

7
  • Problems of interest
  • Locating Base Stations
  • Frequency Assignment
  • Conflict free frequency
  • Connectivity

8
  • Problems of interest
  • Locating Base Stations
  • Frequency Assignment
  • Connectivity
  • Smallest set of Relay Stations.
  • Back to the BS-locator.

9
Main Obstacles
  • Huge inputs ? simplify approximation
  • Formalizing ? objective function
  • NP hardness ? efficient Heuristics

10
Approximating Visibility BCK
  • Given a terrain T and a view point p compute the
    set of points on the surface of T that are
    visible from p.
  • Alternatively Paint T with two colors (red
    blue) s.t. any blue (red) point is visible
    (invisible) from p.

11
left right cross-sections ? pizza slice.
12
Lets look at a specific pizza slice
13
Radar-like generic algorithm
  • Given Terrain (T), view point (vp), and fixed
    angle (aA)
  • while(int i0ilt360)
  • S1cross-section(i)
  • S2cross-section(ia)
  • if(close enough(S1, S2))
  • extrapolate(S1, S2)
  • a A i min(360, i a)
  • else a a/2

14
Radar-like Threshold
Radar-like 10 deg, low threshold
Radar-like 10 deg, hi threshold
15
Error Measure
exact radar approx xor
Error value xor-area / circle-area
16
Radar vs Naïve sampling
Naïve sampling Radar visibility
17
  • Sure, but
  • Cross section distribute computation ? memory
    management issues
  • Interpolation algorithm ? 2 over head

18
(No Transcript)
19
(No Transcript)
20
(No Transcript)
21
(No Transcript)
22
(No Transcript)
23
JPEG
24
  • Terrain Simplification ICTS, BSS-07
  • Radio Maps
  • Any natural 2D matrix
  • dip tools, ROI,
  • hardware, robustness
  • fits GPUs perfectly!

25
ICTS experimental results
ICTS
Original
diff
diff
Qslim
26
Moving into 3D
  • Z-cam ? 2.5D
  • 3D Radio Path ray tracing
  • MRI Volumetric compression
  • FMRI 3.5D

27
3D Ray-Tracing
  • RF wireless communication in mind!
  • ISRC The Israeli Short Range Consortium
  • Motivated by

28
(No Transcript)
29
Problem of interests
29
29
  • Given a geometric properties of a building B. and
    the position of both a transmitter T and a
    receiver R.
  • Find all 3D geometric paths between T and R with
    bounded length.

CGK lab Ariel University Center
30
A building benchmark (complex)
30
30
Two floors, 1600 m2 400 walls, several
types Complex doors, windows
CGK lab Ariel University Center
31
Radio Paths Example?
31
31
  • Radio Paths
  • 2P, 0R
  • 3P, 1R
  • 0P, 1R
  • 2P, 4R cut off
  • penetration point
  • reflection point

31
32
Now, all we got to do is to find the best path
between all the pathes we found
33
(No Transcript)
34
(No Transcript)
35
3D Ray-Tracing
  • Can it be implemented in using GPGPU?
  • Classic problem for distributed machines
  • Current tools are extremely slow!
  • Current research looking into larger urban
    regions.

36
Volumetric Compression
  • MRI in mind
  • MRI high resolution say 10003 voxels
  • JP3D? http//www.jp3d.co.uk/main.html
  • Functional MRI for research (no FDA issues)
    3.5D
  • Current tools are very slow and limited SPM05

37
Robot Configuration Space
  • Motion planning (minimal energy)
  • Very Simple Robot ? 6 deg of freedom (6 motors)
  • Each Motor 20 possible positions ? 6107
    configurations.
  • Step Planning shortest energy-path
  • Discussion!

38
Robot Configuration Space
  • Motion planning (minimal energy)
  • MRI high resolution say 10003 voxels
  • JP3D? http//www.jp3d.co.uk/main.html
  • Functional MRI for research (no FDA issues)
    3.5D
  • Current tools are very slow and limited SPM05

39
physical simulations - serial FORTRAN Gaussian
challenge
  • I know practically Nothing about this issue
  • Fortran large portion of the code is older then
    us!
  • Linda A distributed version of Gaussian
  • SGI, Cray machines strange speed-up behavior
  • Bar-Ilan has the sources and seems to be
    intrested (yet scaptic).

KCG lab Ariel University Center
39
40
Open Discussion
  • 2D Radio Maps terrains,
  • 3D Z-cam, ray-tracing, MRI, FMRI
  • 6D-10D Robot Configuration (ants in mind)
  • Other

KCG lab Ariel University Center
40
Write a Comment
User Comments (0)
About PowerShow.com