http://chimedu1.wikispaces.com/file/view/task.pdf/

The file format is defined as followed: • Every line contains one point • The point definition contains x, y and z coordinates delimited by a space character • Each line is ended by the new line character Please note that only “visible” points from top view must be written to the file (the skin of the point cloud from top view) (Illustration 4). Given: 1. Point class for the definition of a point in 3d and (some) methods for vector algebra 2. Strictly use of STL and C++ stream library 3. Visual C++ 6.0 or .NET as a development environment 4. High level test function to test the resulting component. This defines also the “interface” of the component to be written. Hints: - Create a small documentation 1 page with 2 pictures to present the mathematical approach of the sphere move point intersection. It should clearly communicate the mathematical approach and how the “mathematical” code is generated from that - Use of vector algebra (dot product, cross product etc.) is highly recommended. The use of sin and cos functions is not desired. Calculation speed is important but secondary in comparison to a good object oriented approach. E.g. a sphere, linear move of a sphere, point writer etc. should be modeled as classes. Try to use many of compact classes instead of large classes and large functions. - Comments in the source code are welcomed. Please use “good” names for classes and functions. - Move of a sphere between f (t) and f (t  Δt) can be assumed as a linear move of the center of the sphere.

An agent moves into a space which is composed of several corridors in three related intersection of T-shaped, labeled S1, S2 and S3. Crossroads s1 and S2 are corridors to the east, south and west; intersection s3 are corridors to the east, north and west. Each intersection agent are 2 possible actions: left or right. Actions are Deterministic. If an agent reaches the wall (deadend) Teleport is instantly in intersection point S3 and the girl from the south. Thus, the only possible choice of agent is when you reach one of the 3 intersections and in front of the wall in T. The intersection terms of a learning algorithm by reward, the 3-point selection are the 3 states of the environment. Trazitiile matrix with the states of the agent is given in table 1. Immediate reward is given in table 2. Immediate reward can be interpreted as a negative amount of reward for every meter of the route corridor to the last point plus a selection of reward on teleportare (R and P). To write a program that: - Determine value pairs state-action optimal (Q-learning) and it shows; - Extract a policy of optimal state-action pairs and thus show: Status Worldwide | Action Selected cf optimal policy s1 | S2 | s3 |