Shortest path problemIn graph theory, the shortest path problem is the problem of finding a path between two vertices (or nodes) in a graph such that the sum of the weights of its constituent edges is minimized. The problem of finding the shortest path between two intersections on a road map may be modeled as a special case of the shortest path problem in graphs, where the vertices correspond to intersections and the edges correspond to road segments, each weighted by the length of the segment.
Longest path problemIn graph theory and theoretical computer science, the longest path problem is the problem of finding a simple path of maximum length in a given graph. A path is called simple if it does not have any repeated vertices; the length of a path may either be measured by its number of edges, or (in weighted graphs) by the sum of the weights of its edges. In contrast to the shortest path problem, which can be solved in polynomial time in graphs without negative-weight cycles, the longest path problem is NP-hard and the decision version of the problem, which asks whether a path exists of at least some given length, is NP-complete.
Behavioural sciencesThe behavioural sciences explore the cognitive processes within organisms and the behavioural interactions between organisms in the natural world. It involves the systematic analysis and investigation of human and animal behaviour through naturalistic observation, controlled scientific experimentation and mathematical modeling. It attempts to accomplish legitimate, objective conclusions through rigorous formulations and observation. Examples of behavioural sciences include psychology, psychobiology, anthropology, economics, and cognitive science.
Agent-based modelAn agent-based model (ABM) is a computational model for simulating the actions and interactions of autonomous agents (both individual or collective entities such as organizations or groups) in order to understand the behavior of a system and what governs its outcomes. It combines elements of game theory, complex systems, emergence, computational sociology, multi-agent systems, and evolutionary programming. Monte Carlo methods are used to understand the stochasticity of these models.
RoadA road is a thoroughfare for the conveyance of traffic that mostly has an improved surface for use by vehicles (motorized and non-motorized) and pedestrians. Unlike streets, whose primary function is to serve as public spaces, the main function of roads is transportation. There are many types of roads, including parkways, avenues, controlled-access highways (freeways, motorways, and expressways), tollways, interstates, highways, thoroughfares, and local roads.
Road taxRoad tax, known by various names around the world, is a tax which has to be paid on, or included with, a motorised vehicle to use it on a public road. All states and territories require an annual vehicle registration fee to be paid in order to use a vehicle on public roads; the cost of which varies from state to state and is dependent on the type of vehicle. The fee is known colloquially as 'rego' (pronounced with a soft g, short for registration). Queensland road tax is based on the number of cylinders or rotors the vehicle's engine has.
Dynamical systemIn mathematics, a dynamical system is a system in which a function describes the time dependence of a point in an ambient space, such as in a parametric curve. Examples include the mathematical models that describe the swinging of a clock pendulum, the flow of water in a pipe, the random motion of particles in the air, and the number of fish each springtime in a lake. The most general definition unifies several concepts in mathematics such as ordinary differential equations and ergodic theory by allowing different choices of the space and how time is measured.
