reconnection with the ideal tree

Reconnection with the Ideal Tree A New Approach to Real-Time Search - PowerPoint PPT Presentation

Mar 20, 2024 •150 likes •1.3k views

Search Designing a solution The FRIT Algorithm Results Future work Reconnection with the Ideal Tree A New Approach to Real-Time Search Le on Illanes Department of Computer Science School of Engineering Pontificia Universidad Cat

  1. Search Designing a solution Agent-centered Search The FRIT Algorithm Issue: Heuristic Depressions Results Future work Heuristic learning (` a la LRTA*) 6 5 4 3 2 7 4 3 2 1 8 9 8 1 0 5 4 3 2 1 Path finding in an unknown environment (w/ free-space assumption) Le´ on Illanes Reconnection with the Ideal Tree

  2. Search Designing a solution Agent-centered Search The FRIT Algorithm Issue: Heuristic Depressions Results Future work Heuristic learning (` a la LRTA*) 6 5 4 3 2 7 4 3 2 1 8 9 1 0 10 5 4 3 2 1 Path finding in an unknown environment (w/ free-space assumption) Le´ on Illanes Reconnection with the Ideal Tree

  3. Search Designing a solution Agent-centered Search The FRIT Algorithm Issue: Heuristic Depressions Results Future work Heuristic learning (` a la LRTA*) 6 5 4 3 2 7 4 3 2 1 8 9 1 0 10 5 4 3 2 1 Path finding in an unknown environment (w/ free-space assumption) Le´ on Illanes Reconnection with the Ideal Tree

  4. Search Designing a solution Agent-centered Search The FRIT Algorithm Issue: Heuristic Depressions Results Future work How do we avoid erratic movements? More lookahead More learning Pruning states Le´ on Illanes Reconnection with the Ideal Tree

  5. Search Designing a solution Agent-centered Search The FRIT Algorithm Issue: Heuristic Depressions Results Future work How do we avoid erratic movements? More lookahead More learning Pruning states We asked ourselves: Anything simpler? Le´ on Illanes Reconnection with the Ideal Tree

  6. Search Designing a solution The FRIT Algorithm Design principles Results Future work Design principles 1 2 Le´ on Illanes Reconnection with the Ideal Tree

  7. Search Designing a solution The FRIT Algorithm Design principles Results Future work Design principles Avoid expensive computation 1 Sorting Learning 2 Le´ on Illanes Reconnection with the Ideal Tree

  8. Search Designing a solution The FRIT Algorithm Design principles Results Future work Design principles Avoid expensive computation 1 Sorting Learning Exploit the heuristic 2 Le´ on Illanes Reconnection with the Ideal Tree

  9. Search The Ideal Tree Designing a solution Follow and Reconnect The FRIT Algorithm FRIT and Real-Time Search Results Properties Future work The FRIT Algorithm F ollow and R econnect with the I deal T ree Le´ on Illanes Reconnection with the Ideal Tree

  10. Search The Ideal Tree Designing a solution Follow and Reconnect The FRIT Algorithm FRIT and Real-Time Search Results Properties Future work The Ideal Tree Definition (Ideal Tree) For a problem graph G with goal g and free-space assumption graph G M , we define an Ideal Tree to be any spanning tree for G M rooted at g . Le´ on Illanes Reconnection with the Ideal Tree

  11. Search The Ideal Tree Designing a solution Follow and Reconnect The FRIT Algorithm FRIT and Real-Time Search Results Properties Future work The Ideal Tree Definition (Ideal Tree) For a problem graph G with goal g and free-space assumption graph G M , we define an Ideal Tree to be any spanning tree for G M rooted at g . In practice: parent ( s ) = argmin c ( s , u ) + h ( u ) u :( s , u ) ∈ E ( G M ) Le´ on Illanes Reconnection with the Ideal Tree

  12. Search The Ideal Tree Designing a solution Follow and Reconnect The FRIT Algorithm FRIT and Real-Time Search Results Properties Future work The Ideal Tree Le´ on Illanes Reconnection with the Ideal Tree

  13. Search The Ideal Tree Designing a solution Follow and Reconnect The FRIT Algorithm FRIT and Real-Time Search Results Properties Future work The Ideal Tree Le´ on Illanes Reconnection with the Ideal Tree

  14. Search The Ideal Tree Designing a solution Follow and Reconnect The FRIT Algorithm FRIT and Real-Time Search Results Properties Future work FRIT Input : Given the free-space assumption graph G M , a goal g , and a starting node s 0 . s ← s 0 // Set the current state to s 0 while s � = g do Le´ on Illanes Reconnection with the Ideal Tree

  15. Search The Ideal Tree Designing a solution Follow and Reconnect The FRIT Algorithm FRIT and Real-Time Search Results Properties Future work FRIT Input : Given the free-space assumption graph G M , a goal g , and a starting node s 0 . s ← s 0 // Set the current state to s 0 while s � = g do Observe the environment around s and remove non-existent arcs from G M . Le´ on Illanes Reconnection with the Ideal Tree

  16. Search The Ideal Tree Designing a solution Follow and Reconnect The FRIT Algorithm FRIT and Real-Time Search Results Properties Future work FRIT Input : Given the free-space assumption graph G M , a goal g , and a starting node s 0 . s ← s 0 // Set the current state to s 0 while s � = g do Observe the environment around s and remove non-existent arcs from G M . if s has no parent node then Reconnect: Le´ on Illanes Reconnection with the Ideal Tree

  17. Search The Ideal Tree Designing a solution Follow and Reconnect The FRIT Algorithm FRIT and Real-Time Search Results Properties Future work FRIT Input : Given the free-space assumption graph G M , a goal g , and a starting node s 0 . s ← s 0 // Set the current state to s 0 while s � = g do Observe the environment around s and remove non-existent arcs from G M . if s has no parent node then Reconnect: Follow: Le´ on Illanes Reconnection with the Ideal Tree

  18. Search The Ideal Tree Designing a solution Follow and Reconnect The FRIT Algorithm FRIT and Real-Time Search Results Properties Future work FRIT Input : Given the free-space assumption graph G M , a goal g , and a starting node s 0 . s ← s 0 // Set the current state to s 0 while s � = g do Observe the environment around s and remove non-existent arcs from G M . if s has no parent node then Reconnect: Follow: s ← parent ( s ) // Move the agent to the parent of s Le´ on Illanes Reconnection with the Ideal Tree

  19. Search The Ideal Tree Designing a solution Follow and Reconnect The FRIT Algorithm FRIT and Real-Time Search Results Properties Future work FRIT Input : Given the free-space assumption graph G M , a goal g , and a starting node s 0 . s ← s 0 // Set the current state to s 0 while s � = g do Observe the environment around s and remove non-existent arcs from G M . if s has no parent node then Reconnect: Locally search around s to find any state s ′ connected to g . Update the Ideal Tree to include the path from s to s ′ . Follow: s ← parent ( s ) // Move the agent to the parent of s Le´ on Illanes Reconnection with the Ideal Tree

  20. Search The Ideal Tree Designing a solution Follow and Reconnect The FRIT Algorithm FRIT and Real-Time Search Results Properties Future work FRIT by example Observe Follow Reconnect Le´ on Illanes Reconnection with the Ideal Tree

  21. Search The Ideal Tree Designing a solution Follow and Reconnect The FRIT Algorithm FRIT and Real-Time Search Results Properties Future work FRIT by example Follow Reconnect Observe Le´ on Illanes Reconnection with the Ideal Tree

  22. Search The Ideal Tree Designing a solution Follow and Reconnect The FRIT Algorithm FRIT and Real-Time Search Results Properties Future work FRIT by example Observe Reconnect Follow Le´ on Illanes Reconnection with the Ideal Tree

  23. Search The Ideal Tree Designing a solution Follow and Reconnect The FRIT Algorithm FRIT and Real-Time Search Results Properties Future work FRIT by example Follow Reconnect Observe Le´ on Illanes Reconnection with the Ideal Tree

  24. Search The Ideal Tree Designing a solution Follow and Reconnect The FRIT Algorithm FRIT and Real-Time Search Results Properties Future work FRIT by example Observe Reconnect Follow Le´ on Illanes Reconnection with the Ideal Tree

  25. Search The Ideal Tree Designing a solution Follow and Reconnect The FRIT Algorithm FRIT and Real-Time Search Results Properties Future work FRIT by example Follow Reconnect Observe Le´ on Illanes Reconnection with the Ideal Tree

  26. Search The Ideal Tree Designing a solution Follow and Reconnect The FRIT Algorithm FRIT and Real-Time Search Results Properties Future work FRIT by example Observe Follow Reconnect Le´ on Illanes Reconnection with the Ideal Tree

  27. Search The Ideal Tree Designing a solution Follow and Reconnect The FRIT Algorithm FRIT and Real-Time Search Results Properties Future work FRIT by example Observe Follow Reconnect Le´ on Illanes Reconnection with the Ideal Tree

  28. Search The Ideal Tree Designing a solution Follow and Reconnect The FRIT Algorithm FRIT and Real-Time Search Results Properties Future work FRIT by example Observe Follow Reconnect Le´ on Illanes Reconnection with the Ideal Tree

  29. Search The Ideal Tree Designing a solution Follow and Reconnect The FRIT Algorithm FRIT and Real-Time Search Results Properties Future work FRIT by example Observe Follow Reconnect Le´ on Illanes Reconnection with the Ideal Tree

  30. Search The Ideal Tree Designing a solution Follow and Reconnect The FRIT Algorithm FRIT and Real-Time Search Results Properties Future work FRIT by example Observe Follow Reconnect Le´ on Illanes Reconnection with the Ideal Tree

  31. Search The Ideal Tree Designing a solution Follow and Reconnect The FRIT Algorithm FRIT and Real-Time Search Results Properties Future work FRIT by example Observe Follow Reconnect Le´ on Illanes Reconnection with the Ideal Tree

  32. Search The Ideal Tree Designing a solution Follow and Reconnect The FRIT Algorithm FRIT and Real-Time Search Results Properties Future work FRIT by example Observe Reconnect Follow Le´ on Illanes Reconnection with the Ideal Tree

  33. Search The Ideal Tree Designing a solution Follow and Reconnect The FRIT Algorithm FRIT and Real-Time Search Results Properties Future work A better example Le´ on Illanes Reconnection with the Ideal Tree

  34. Search The Ideal Tree Designing a solution Follow and Reconnect The FRIT Algorithm FRIT and Real-Time Search Results Properties Future work A better example Le´ on Illanes Reconnection with the Ideal Tree

  35. Search The Ideal Tree Designing a solution Follow and Reconnect The FRIT Algorithm FRIT and Real-Time Search Results Properties Future work A better example Le´ on Illanes Reconnection with the Ideal Tree

  36. Search The Ideal Tree Designing a solution Follow and Reconnect The FRIT Algorithm FRIT and Real-Time Search Results Properties Future work A better example Le´ on Illanes Reconnection with the Ideal Tree

  37. Search The Ideal Tree Designing a solution Follow and Reconnect The FRIT Algorithm FRIT and Real-Time Search Results Properties Future work A better example Le´ on Illanes Reconnection with the Ideal Tree

  38. Search The Ideal Tree Designing a solution Follow and Reconnect The FRIT Algorithm FRIT and Real-Time Search Results Properties Future work A better example Le´ on Illanes Reconnection with the Ideal Tree

  39. Search The Ideal Tree Designing a solution Follow and Reconnect The FRIT Algorithm FRIT and Real-Time Search Results Properties Future work A better example Le´ on Illanes Reconnection with the Ideal Tree

  40. Search The Ideal Tree Designing a solution Follow and Reconnect The FRIT Algorithm FRIT and Real-Time Search Results Properties Future work A better example Le´ on Illanes Reconnection with the Ideal Tree

  41. Search The Ideal Tree Designing a solution Follow and Reconnect The FRIT Algorithm FRIT and Real-Time Search Results Properties Future work A better example Le´ on Illanes Reconnection with the Ideal Tree

  42. Search The Ideal Tree Designing a solution Follow and Reconnect The FRIT Algorithm FRIT and Real-Time Search Results Properties Future work A better example Le´ on Illanes Reconnection with the Ideal Tree

  43. Search The Ideal Tree Designing a solution Follow and Reconnect The FRIT Algorithm FRIT and Real-Time Search Results Properties Future work A better example Le´ on Illanes Reconnection with the Ideal Tree

  44. Search The Ideal Tree Designing a solution Follow and Reconnect The FRIT Algorithm FRIT and Real-Time Search Results Properties Future work A better example Le´ on Illanes Reconnection with the Ideal Tree

  45. Search The Ideal Tree Designing a solution Follow and Reconnect The FRIT Algorithm FRIT and Real-Time Search Results Properties Future work A better example Le´ on Illanes Reconnection with the Ideal Tree

  46. Search The Ideal Tree Designing a solution Follow and Reconnect The FRIT Algorithm FRIT and Real-Time Search Results Properties Future work A better example Le´ on Illanes Reconnection with the Ideal Tree

  47. Search The Ideal Tree Designing a solution Follow and Reconnect The FRIT Algorithm FRIT and Real-Time Search Results Properties Future work A better example Le´ on Illanes Reconnection with the Ideal Tree

  48. Search The Ideal Tree Designing a solution Follow and Reconnect The FRIT Algorithm FRIT and Real-Time Search Results Properties Future work A better example Le´ on Illanes Reconnection with the Ideal Tree

  49. Search The Ideal Tree Designing a solution Follow and Reconnect The FRIT Algorithm FRIT and Real-Time Search Results Properties Future work A better example Le´ on Illanes Reconnection with the Ideal Tree

  50. Search The Ideal Tree Designing a solution Follow and Reconnect The FRIT Algorithm FRIT and Real-Time Search Results Properties Future work A better example Le´ on Illanes Reconnection with the Ideal Tree

  51. Search The Ideal Tree Designing a solution Follow and Reconnect The FRIT Algorithm FRIT and Real-Time Search Results Properties Future work Video! Le´ on Illanes Reconnection with the Ideal Tree

  52. Search The Ideal Tree Designing a solution Follow and Reconnect The FRIT Algorithm FRIT and Real-Time Search Results Properties Future work The Real-Time Property As described, FRIT is not a Real-Time Search Algorithm. We need a bound on the amount of states visited while reconnecting. Le´ on Illanes Reconnection with the Ideal Tree

  53. Search The Ideal Tree Designing a solution Follow and Reconnect The FRIT Algorithm FRIT and Real-Time Search Results Properties Future work The Real-Time Property As described, FRIT is not a Real-Time Search Algorithm. We need a bound on the amount of states visited while reconnecting. What to do when the bound is surpassed? Le´ on Illanes Reconnection with the Ideal Tree

  54. Search The Ideal Tree Designing a solution Follow and Reconnect The FRIT Algorithm FRIT and Real-Time Search Results Properties Future work Two approaches 1 2 Le´ on Illanes Reconnection with the Ideal Tree

  55. Search The Ideal Tree Designing a solution Follow and Reconnect The FRIT Algorithm FRIT and Real-Time Search Results Properties Future work Two approaches Standard FRIT: Do nothing. . . [RIBH13, RIBH14] 1 2 Le´ on Illanes Reconnection with the Ideal Tree

  56. Search The Ideal Tree Designing a solution Follow and Reconnect The FRIT Algorithm FRIT and Real-Time Search Results Properties Future work Two approaches Standard FRIT: Do nothing. . . [RIBH13, RIBH14] 1 FRIT RT : Use a Real-Time Search Algorithm for 2 Reconnection. [RIBH14] Le´ on Illanes Reconnection with the Ideal Tree

  57. Search The Ideal Tree Designing a solution Follow and Reconnect The FRIT Algorithm FRIT and Real-Time Search Results Properties Future work Complexity Follow is O (1) Le´ on Illanes Reconnection with the Ideal Tree

  58. Search The Ideal Tree Designing a solution Follow and Reconnect The FRIT Algorithm FRIT and Real-Time Search Results Properties Future work Complexity Follow is O (1) Reconnect can be O ( | V | ) Le´ on Illanes Reconnection with the Ideal Tree

  59. Search The Ideal Tree Designing a solution Follow and Reconnect The FRIT Algorithm FRIT and Real-Time Search Results Properties Future work Complexity Follow is O (1) Reconnect can be O ( | V | ) Reconnect can be O ( | V | ). Using BFS as the local search algorithm, we check at most | V | nodes to see if they are connected to the goal. This check can be done as a recursive function with no side effects and can thus be memoized, ensuring that for each reconnection search we do at most | V | comparisons. Le´ on Illanes Reconnection with the Ideal Tree

  60. Search The Ideal Tree Designing a solution Follow and Reconnect The FRIT Algorithm FRIT and Real-Time Search Results Properties Future work Complexity Follow is O (1) Reconnect can be O ( | V | ) Reconnect can be O ( | V | ). Using BFS as the local search algorithm, we check at most | V | nodes to see if they are connected to the goal. This check can be done as a recursive function with no side effects and can thus be memoized, ensuring that for each reconnection search we do at most | V | comparisons. Additionally, we prove correcteness and completeness for both FRIT and FRIT RT , while giving an explicit upper bound of ( | V | +1) 2 4 moves for FRIT and O ( | V | 3 ) moves for FRIT RT . Le´ on Illanes Reconnection with the Ideal Tree

  61. Search The Ideal Tree Designing a solution Follow and Reconnect The FRIT Algorithm FRIT and Real-Time Search Results Properties Future work Convergence FRIT immediately converges to a suboptimal solution Le´ on Illanes Reconnection with the Ideal Tree

  62. Search The Ideal Tree Designing a solution Follow and Reconnect The FRIT Algorithm FRIT and Real-Time Search Results Properties Future work Convergence FRIT immediately converges to a suboptimal solution Le´ on Illanes Reconnection with the Ideal Tree

  63. Search The Ideal Tree Designing a solution Follow and Reconnect The FRIT Algorithm FRIT and Real-Time Search Results Properties Future work Convergence FRIT immediately converges to a suboptimal solution Le´ on Illanes Reconnection with the Ideal Tree

  64. Search Designing a solution FRIT RT The FRIT Algorithm FRIT with BFS Results Comparison between approaches Future work Games: FRIT RT halves daRTAA*’s solutions 10000000 FRIT_rt(RTAA) FRIT_rt(daRTAA) Average Solution Cost (log-scale) RTAA 1000000 daRTAA 100000 10000 1000 0 20 40 60 80 100 120 140 Average time per planning episode (us) Le´ on Illanes Reconnection with the Ideal Tree

  65. Search Designing a solution FRIT RT The FRIT Algorithm FRIT with BFS Results Comparison between approaches Future work Mazes: Similar tendencies 10000000 FRIT_rt(RTAA) FRIT_rt(daRTAA) Average Solution Cost (log-scale) RTAA 1000000 daRTAA 100000 10000 1000 0 20 40 60 80 100 120 Average time per planning episode (us) Le´ on Illanes Reconnection with the Ideal Tree

  66. Search Designing a solution FRIT RT The FRIT Algorithm FRIT with BFS Results Comparison between approaches Future work Games: FRIT dominates for very small t 10000000 FRIT(BFS) Average Solution Length (log-scale) RA* AA* 1000000 100000 10000 1000 0 100 200 300 400 500 600 Average time per planning episode (us) Le´ on Illanes Reconnection with the Ideal Tree

  67. Search Designing a solution FRIT RT The FRIT Algorithm FRIT with BFS Results Comparison between approaches Future work Mazes: Again, similar tendencies 10000000 FRIT(BFS) Average Solution Length (log-scale) RA* AA* 1000000 100000 10000 1000 0 100 200 300 400 500 600 Average time per planning episode (us) Le´ on Illanes Reconnection with the Ideal Tree

  68. Search Designing a solution FRIT RT The FRIT Algorithm FRIT with BFS Results Comparison between approaches Future work FRIT(BFS) obtains better solutions 10000000 FRIT_rt(daRTAA) Average Solution Length (log-scale) FRIT(BFS) 1000000 100000 10000 1000 0 10 20 30 40 50 60 Average time per planning episode (us) Le´ on Illanes Reconnection with the Ideal Tree

  69. Search Designing a solution The FRIT Algorithm Results Future work Future work Other applications Optimizing for pathfinding in grids [RIB14] Moving-target search Dense graphs (e.g.: Airport networks) Le´ on Illanes Reconnection with the Ideal Tree

Recommend

How SMPng Works and Why It Doesn't Work The Way You Think NYC*BUG February 6, 2013 John Baldwin

How SMPng Works and Why It Doesn't Work The Way You Think NYC*BUG February 6, 2013 John Baldwin

How SMPng Works and Why It Doesn't Work The Way You Think NYC*BUG February 6, 2013 John Baldwin jhb@FreeBSD.org Ideal SMP Ideal Ideal SMP Ideal Best Ideal SMP Ideal Best Decent Ideal SMP Ideal Best Decent Hump Ideal SMP Ideal

886 views • 21 slides
Colour Reconnection - Models and Tests Jesper Roy Christiansen Lund University July 23, 2015

Colour Reconnection - Models and Tests Jesper Roy Christiansen Lund University July 23, 2015

Colour Reconnection - Models and Tests Jesper Roy Christiansen Lund University July 23, 2015 EPS HEP, Vienna JRC (Lund) Colour Reconnection July 23, EPS 1 / 10 Introduction - What is Colour Reconnection? CR address the question: between

369 views • 12 slides
Lecture 10: Ideal Filters Mark Hasegawa-Johnson ECE 401: Signal and Image Analysis, Fall 2020

Lecture 10: Ideal Filters Mark Hasegawa-Johnson ECE 401: Signal and Image Analysis, Fall 2020

DTFT Ideal LPF Ideal HPF Ideal BPF Finite-Length Even Length Summary Lecture 10: Ideal Filters Mark Hasegawa-Johnson ECE 401: Signal and Image Analysis, Fall 2020 DTFT Ideal LPF Ideal HPF Ideal BPF Finite-Length Even Length Summary

1.26k views • 47 slides
Are Hybrid Physical Designs Important? 1 B+ tree 2 C O L B+ tree 3 ? C O L C O L B+ tree

Are Hybrid Physical Designs Important? 1 B+ tree 2 C O L B+ tree 3 ? C O L C O L B+ tree

Columnstore and B+ tree Are Hybrid Physical Designs Important? 1 B+ tree 2 C O L B+ tree 3 ? C O L C O L B+ tree B+ tree B+ tree & Columnstore on same table = Hybrid design 4 ? C O L C O L B+ tree B+ tree Are Hybrid

1.09k views • 79 slides
Ideal Gas State functions: Consider 1 mole of an ideal gas Ideal Gas State functions: Consider 1

Ideal Gas State functions: Consider 1 mole of an ideal gas Ideal Gas State functions: Consider 1

Ideal Gas State functions: Consider 1 mole of an ideal gas Ideal Gas State functions: Consider 1 mole of an ideal gas PV = RT PV = RT Suppose begin with: Suppose begin with: P 1 = 5 atm atm V 2 = 4.92 liters T 1 = 300 o o K K P 1 = 5 V 2

316 views • 17 slides
61A Lecture 21 Announcements Binary Trees Binary Tree Class 4 Binary Tree Class class

61A Lecture 21 Announcements Binary Trees Binary Tree Class 4 Binary Tree Class class

61A Lecture 21 Announcements Binary Trees Binary Tree Class 4 Binary Tree Class class BTree(Tree): 4 Binary Tree Class A binary tree is a tree that has class BTree(Tree): a left branch and a right branch 4 Binary Tree Class A binary

1.05k views • 93 slides
Evolution of the magnetic topology due to reconnection in a 3D MHD corona above an active region

Evolution of the magnetic topology due to reconnection in a 3D MHD corona above an active region

M. Druckmller, M. Dietzel, P. Aniol, V. Ruin; Aug. 2008 (Mongolia) Evolution of the magnetic topology due to reconnection in a 3D MHD corona above an active region (Magnetic Reconnection Workshop, NORDITA/Stockholm, 29 th July 2015)

911 views • 36 slides
INFERRING RECONNECTION ENERGY RELEASE FROM UV/EUV SIGNATURES IN FLARES MSU Solar Physics REU

INFERRING RECONNECTION ENERGY RELEASE FROM UV/EUV SIGNATURES IN FLARES MSU Solar Physics REU

INFERRING RECONNECTION ENERGY RELEASE FROM UV/EUV SIGNATURES IN FLARES MSU Solar Physics REU Zoe Sturrock Advisor: Jiong Qiu Outline General background (Magnetic reconnection) Project outline Model Results and comparison with

841 views • 19 slides
Introduction Magnetic reconnection is Very powerful energy converter Very common in the

Introduction Magnetic reconnection is Very powerful energy converter Very common in the

Self-similar evolution of fast magnetic reconnection in free-space: A new model for astrophysical reconnection Shin-ya Nitta The Graduate University for Advanced Studies, Hayama Center for Advanced Studies E-mail:

172 views • 15 slides
Tree-sitter @maxbrunsfeld What is Tree-sitter? Why I wrote Tree-sitter What were

Tree-sitter @maxbrunsfeld What is Tree-sitter? Why I wrote Tree-sitter What were

Tree-sitter @maxbrunsfeld What is Tree-sitter? Why I wrote Tree-sitter What were building with Tree-sitter at GitHub Algorithms behind Tree-sitter What is Tree-si tu er? Uniform parsing of di ff erent languages if (a) c();

772 views • 75 slides
Final Examples Announcements Trees Tree-Structured Data def tree(label, branches=[]): A tree

Final Examples Announcements Trees Tree-Structured Data def tree(label, branches=[]): A tree

Final Examples Announcements Trees Tree-Structured Data def tree(label, branches=[]): A tree can contains other trees: return [label] + list(branches) [5, [6, 7], 8, [[9], 10]] def label(tree): return tree[0] (+ 5 (- 6 7) 8 (* (- 9) 10))

537 views • 14 slides
Marketing Mashup Ideal Customers Relationships Matter Quick Wins Ideal Customer

Marketing Mashup Ideal Customers Relationships Matter Quick Wins Ideal Customer

Marketing Mashup Ideal Customers Relationships Matter Quick Wins Ideal Customer Stop chasing every deal Stop trying to be all things Go deeper than Target Market Ideal Customer Ask 5 questions Simple things will

254 views • 10 slides
Text-Based Ideal Points Keyon Vafa Columbia University Joint work with: Suresh Naidu David

Text-Based Ideal Points Keyon Vafa Columbia University Joint work with: Suresh Naidu David

Text-Based Ideal Points Keyon Vafa Columbia University Joint work with: Suresh Naidu David Blei Columbia University Columbia University Ideal Points Image Source: New York Times Ideal Points Bayesian Ideal Points Probabilistic method

615 views • 23 slides
PLTree A tree programming language Overview Philosophy: Everything is a tree All data structures

PLTree A tree programming language Overview Philosophy: Everything is a tree All data structures

PLTree A tree programming language Overview Philosophy: Everything is a tree All data structures are built on the tree A primitive type is a tree with a single node at the root and no leaves A string is a tree of characters A function is a

371 views • 13 slides
Education Endowment (TREE) Fund TREE Fund is a 501(c)3 nonprofit organization that supports

Education Endowment (TREE) Fund TREE Fund is a 501(c)3 nonprofit organization that supports

Tree Research and Education Endowment (TREE) Fund TREE Fund is a 501(c)3 nonprofit organization that supports scientific discovery and dissemination of new knowledge in arboriculture and urban forestry. TREE Fund Grant Awards TREE Fund has

441 views • 10 slides
Services Using E-Tree Service Type Ethernet Private Tree (EP-Tree) and Ethernet Virtual Private

Services Using E-Tree Service Type Ethernet Private Tree (EP-Tree) and Ethernet Virtual Private

E-TREE Requirements and Solution space Jim Uttaro (uttaro@att.com) Nick Delregno (nick.delregno@verizon.com) Florin Balus (florin.balus@alcatel-lucent.com) Services Using E-Tree Service Type Ethernet Private Tree (EP-Tree) and Ethernet

387 views • 12 slides
Pulsar Realtime Analytics At Scale Tony Ng April 14, 2015 Big Data Trends Bigger data

Pulsar Realtime Analytics At Scale Tony Ng April 14, 2015 Big Data Trends Bigger data

Pulsar Realtime Analytics At Scale Tony Ng April 14, 2015 Big Data Trends Bigger data volumes More data sources DBs, logs, behavioral & business event streams, sensors Faster analysis Next day to hours to minutes to

496 views • 24 slides
Natural Language Processing with Deep Learning CS224N/Ling284 Christopher Manning Lecture 11:

Natural Language Processing with Deep Learning CS224N/Ling284 Christopher Manning Lecture 11:

Natural Language Processing with Deep Learning CS224N/Ling284 Christopher Manning Lecture 11: ConvNets for NLP Lecture Plan Lecture 11: ConvNets for NLP 1. Announcements (5 mins) 2. Intro to CNNs (20 mins) 3. Simple CNN for Sentence

944 views • 57 slides
Unplanned Returns to Hospital Care: A Linked Data Study Kathy SMITH 1 and Renee IANNOTTI Health

Unplanned Returns to Hospital Care: A Linked Data Study Kathy SMITH 1 and Renee IANNOTTI Health

Unplanned Returns to Hospital Care: A Linked Data Study Kathy SMITH 1 and Renee IANNOTTI Health System Information and Performance Reporting Branch, NSW Ministry of Health Abstract. The linkage of data across facilities and settings of care

371 views • 7 slides
Course Introduction Dr. Mattox Beckman University of Illinois at Urbana-Champaign Department of

Course Introduction Dr. Mattox Beckman University of Illinois at Urbana-Champaign Department of

Introduction and Logistics Course Goals Administrative Items Course Introduction Dr. Mattox Beckman University of Illinois at Urbana-Champaign Department of Computer Science Introduction and Logistics Course Goals Administrative Items

396 views • 22 slides
Real-Time Motion Planning and Autonomous Driving Jeffrey Ichnowski What is Real-Time

Real-Time Motion Planning and Autonomous Driving Jeffrey Ichnowski What is Real-Time

Real-Time Motion Planning and Autonomous Driving Jeffrey Ichnowski What is Real-Time Motion Planning? 1 st floor vs. 2 nd floor Motion planning with a hard real-time constraint. temporally correct T i = ( i , p i , e i , D i )

565 views • 37 slides
COSMOS Outreach Activities and Industry Involvement COSMOS PLATFORM FOR ADVANCED WIRELESS

COSMOS Outreach Activities and Industry Involvement COSMOS PLATFORM FOR ADVANCED WIRELESS

COSMOS Outreach Activities and Industry Involvement COSMOS PLATFORM FOR ADVANCED WIRELESS RESEARCH AN INDUSTRY BRIEFING Thanasis Korakis, NYU Clayton Banks, Silicon Harlem Rutgers University, June 1 2018 COSMOS Outreach Activities COSMOS

307 views • 18 slides
Contributions Introduction Data Exploration without Specification B. Saket, H. Kim, E. T. Brown

Contributions Introduction Data Exploration without Specification B. Saket, H. Kim, E. T. Brown

Visualization by Demonstration: An Interaction Paradigm for Visual Data Exploration Contributions Introduction Data Exploration without Specification B. Saket, H. Kim, E. T. Brown and A. Endert IEEE Transactions on Visualization and Computer

464 views • 3 slides
Online Multi-Agent Pathfinding Intelligent Robotics Fin Tter Technical Aspects of Multimodal

Online Multi-Agent Pathfinding Intelligent Robotics Fin Tter Technical Aspects of Multimodal

Motivation Offline MAPF Online MAPF References Online Multi-Agent Pathfinding Intelligent Robotics Fin Tter Technical Aspects of Multimodal Systems November 25, 2019 Fin Tter Online Multi-Agent Pathfinding 1 / 27 Motivation Offline

592 views • 32 slides

More recommend