# Tag Info

5

Take a robot that we want to be able to move from the bottom right corner to the top left corner of a 4x4 matrix full of random holes it should avoid. With holes represented by 1s, it could look something like: exit \/ [0,0,0,1] [0,1,1,0] [0,1,1,1] [0,0,0,0] /\ enter As we want it to get to an exit from a start, we have a natural fitness ...

3

As you say, GPS is not precise enough for the purpose (until recently it was only accurate within 5m or so, since 2018 there are receivers that have an accuracy of about 30cm). Instead, autonomous vehicles have a multitude of sensors, mostly cameras and radar, which record the surrounding area and monitor the road ahead. Due to them being flat, mostly one ...

3

I would start with: PoseNet: A Convolutional Network for Real-Time 6-DOF Camera Relocalization VidLoc: A Deep Spatio-Temporal Model for 6-DoF Video-Clip Relocalization Image-based localization using LSTMs for structured feature correlation Image-based Localization using Hourglass Networks UAN: Unified Attention Network for Convolutional Neural Networks ...

2

You can implement a Reinforcement Learning agent with the following aspects: Action Space An action of adding or removing a question of a certain category, e.g. Add a grammar question, remove a grammar question, add vocabulary question, etc. State Space Using the Flow Model, you can build a vector of flow features per topic. such that each element in ...

2

A simple decision tree would be suitable, and represents one of the easiest forms of AI. Don't over-complicate simple problems. The simplest approach would likely run faster, and require less system resources, so, unless this project is designed as an entree into machine learning, that approach is way overkill for this simple problem.

2

You could build a MLC(machine learning classifier) based on her/his answers and apply that to a large database of questions to see which type of questions will probably yield an incorrect answer. And then provide those questions (Assuming one would learn more from working at her/his weaknesses) to provide a steeper learning curve, continuously adapting ...

2

even though that's not really AI, the easiest way to do that would probably be to put coefficients on each question e.g. your question would have something like grammar=0.55 vocabulary=0.45 if(won){ success=-1 }else{ success=1 } the lower the level, the less questions of this type will appear at the end of the level, you sum each question times how ...

2

If I had to implement a path exploration/finding algorithm on a robot, I would follow these steps: Make sure you can detect your position. You need to be able to record your position otherwise you have no reference for the exploration. You don't need a global positioning system (like GPS), a local one is more than enough in your case. This means that the ...

2

Let's say I have a white image, a green blob in the middle, and points $A$ and $B$ at either side of the blob, I need to get from $A$ to $B$. I don't have points to traverse. I just have this image. If your image is as "simple" as you describe here, with very easily distinguishable colours, the easiest solution would likely be to construct a graph ...

1

Defining Path You are right to be confused if your professors did not clarify (see warning at end). The term "path" can mean a few things: "Concrete" Path: Recall, a graph is a collection of vertices and edges. A path on the graph is then: $$v_1\xrightarrow{e_1} v_2\xrightarrow{e_2} \cdots \xrightarrow{e_{n-1}} v_n$$ Where $v_i$ are vertices on the graph ...

1

Your best bet would be to formulate the problem in PDDL, which should be fairly easy, and then use a standard planner to generate a plan from that description. In PDDL you describe the properties and the possible actions, the start state and the goal state, and the planner will then take this to produce a sequence of actions that leads from the start state ...

1

Since you mention the A* algorithm, then you are definitely using a heuristic somewhere in there, at least with the A* algorithm while solving the subproblems using the straight-line distance as your heuristic function. Although your approach does not seem to incorporate a "shortcut mathematical formula" as a heuristic after that, it does us a precalculated ...

1

A 'heuristic' is simply a 'rule-of-thumb', i.e. something which doesn't guarantee an optimal solution to a problem. Beyond the above notion (certainly within the discipline of optimization), the notion of what constitutes a heuristic is not particularly strict, and could certainly include hints for constructing a new solution from parts of a previous one, ...

1

Whether or not a label fits any particular instance depends on what you're using the label for. If something specific is riding on whether this approach is a 'heuristic' or not, that context is important. But I wouldn't call this a heuristic, because I think of that as a shortcut for solving a problem, not either storing a solution or reformulating the ...

1

An agent perceives the environment through sensors and act according to the incoming percepts (agent's perceptual input at any instant). An autonomous vacuum cleaner can be as simple as (blocki, clean) --> Move to blocki+1 (blocki, dirty) --> Clean This is just a general description, actual one is more complicated. Or the bot can have a memory where it ...

Only top voted, non community-wiki answers of a minimum length are eligible