Search icon CANCEL
Subscription
0
Cart icon
Your Cart (0 item)
Close icon
You have no products in your basket yet
Save more on your purchases now! discount-offer-chevron-icon
Savings automatically calculated. No voucher code required.
Arrow left icon
Explore Products
Best Sellers
New Releases
Books
Videos
Audiobooks
Learning Hub
Conferences
Free Learning
Arrow right icon
Arrow up icon
GO TO TOP
Artificial Intelligence for Robotics

You're reading from   Artificial Intelligence for Robotics Build intelligent robots that perform human tasks using AI techniques

Arrow left icon
Product type Paperback
Published in Aug 2018
Publisher Packt
ISBN-13 9781788835442
Length 344 pages
Edition 1st Edition
Languages
Tools
Arrow right icon
Author (1):
Arrow left icon
Francis X. Govers III Francis X. Govers III
Author Profile Icon Francis X. Govers III
Francis X. Govers III
Arrow right icon
View More author details
Toc

Table of Contents (13) Chapters Close

Preface 1. Foundation for Advanced Robotics and AI 2. Setting Up Your Robot FREE CHAPTER 3. A Concept for a Practical Robot Design Process 4. Object Recognition Using Neural Networks and Supervised Learning 5. Picking up the Toys 6. Teaching a Robot to Listen 7. Avoiding the Stairs 8. Putting Things Away 9. Giving the Robot an Artificial Personality 10. Conclusions and Reflections 11. Assessments 12. Other Books You May Enjoy

Questions

  1. What are the three ways to traverse a decision tree?
  2. In the Fishbone diagram example, how does one go about pruning the branches of the decision tree?
  3. What is the role of the Gini evaluator in creating a classification?
  4. In the toy classifier example using Gini indexing, which attributes of the toy were not used by the decision tree? Why not?
  5. Which color for the toys was used as a criteria by one of the classification techniques we tried?
  6. Give an example of label encoding and one hot encoding for menu items at a restaurant.
  7. In the A* algorithm, discuss the different ways that G() and H() are computed.
  8. In the A* algorithm, why is H() considered a heuristic and G() is not. Also, in the D* algorithm, heuristics are not used. Why not?
  9. In the D* algorithm, why is there a RAISED and a LOWERED tag and not just a CHANGED flag?
...
lock icon The rest of the chapter is locked
Register for a free Packt account to unlock a world of extra content!
A free Packt account unlocks extra newsletters, articles, discounted offers, and much more. Start advancing your knowledge today.
Unlock this book and the full library FREE for 7 days
Get unlimited access to 7000+ expert-authored eBooks and videos courses covering every tech area you can think of
Renews at $19.99/month. Cancel anytime