Objective Your primary objective is to implement and test the dynamic movement update and three dynamic movement behaviors, Seek, Flee, and Arrive. Your secondary $($optional$)$ objective is to learn how to plot your movement trajectories.Objectivesteering behavior code $(1=$ Continue, $6=$ Seek, $7=$ Flee, $8=$ Arrive$)$

collision status $($TRUE if collided, FALSE if not collided; always FALSE for Program $1)$

Run your program for $50$ simulated seconds with a timestep duration of $0\mathrm{.}5$ using Newton$-$Euler$-1$

integration, i$.$e$.,100$ timesteps after initialization. Your scenario should have four characters with

the initial conditions in the following table. The movement target of the Flee, Seek, and Arrive

characters is the Continue character.

Your primary objective is to implement and test the dynamic movement update and three dynamic

movement behaviors, Seek, Flee, and Arrive. Your secondary $($optional$)$ objective is to learn how to

plot your movement trajectories.

Requirements

Implement the dynamic version of the Newton$-$Euler$-1$ movement update algorithm and the dynamic

Seek, Flee, and Arrive movement behaviors. ff Also implement a Continue movement behavior, which does not alter a

character's movement at all, but simply uses the initial values. The Continue behavior is not in the

textbook, but it is in the $R$ implementation. For this assignment, the Continue character's initial

velocity and rotation will all be $0,$ so the Continue character should not move at all.

Your program should output each character's trajectory as a text file $(.$txt$).$ The output file should

have one record per character per timestep, including a record for the initial conditions $($time $=0).$

For example, for a scenario with $4$ characters that runs for $50$ timesteps, there should $204$ records in

the output file, in the following order. $($This list shows proper order, but not proper format for the

output file.$)$

character $1,$ timestep $0$

character $2,$ timestep $0$

character $3,$ timestep $0$

character $4,$ timestep $0$

character $1,$ timestep $1$

character $2,$ timestep $1$

character $3,$ timestep $1$

character $4,$ timestep $1$

$...$

character $1,$ timestep $50$

character $2,$ timestep $50$

character $3,$ timestep $50$

character $4,$ timestep $50$

Each record should have the following $11$ fields, in the order listed, and separated by commas:

simulation time

character id $($numeric$)$

position $x($meters$)$

position $z($meters$)$

velocity $x($meters per second$)$

velocity $z($meters per second$)$

linear acceleration $x($meters per second per second$)$

linear acceleration $z($meters per second per second$)$

orientation $($radians$)$steering behavior code $(1=$ Continue, $6=$ Seek, $7=$ Flee, $8=$ Arrive$)$

collision status $($TRUE if collided, FALSE if not collided; always FALSE for Program $1)$

Run your program for $50$ simulated seconds with a timestep duration of $0\mathrm{.}5$ using Newton$-$Euler$-1$

integration, i$.$e$.,100$ timesteps after initialization. Your scenario should have four characters with

the initial conditions in the following table. The movement target of the Flee, Seek, and Arrive

characters is the Continue character.Replicate, as closely as possible, the character movement trajectories shown in the preceding image.