Databases
StackOverflow2013
Postsdbo
POBest algorithm for optimizing the decisions in a simulation
 

Note that there are some explanatory texts on larger screens.

plurals
  1. POBest algorithm for optimizing the decisions in a simulation
    primarykey
    data
    text
    <p>I'm looking for the best algorithm to optimise the decisions made in a simultaion to find a fast result in a reasonable amount of time. The simultaion does a number of "ticks" and occasionaly needs to make a decision. Eventually a goal state is reached. ( It would be possible to never reach a goal state if you make very bad decisions ) </p> <p>There are many many goal states. I want to find the goal state with the least number of ticks ( a tick equates roughly to a second in real life." I basically want to decide which decisions to make to get to the goal in as few seconds as possible,</p> <p>Some points about the problem domain:</p> <ul> <li>Straight off the bat I can generate a series of choices that will lead to a solution. It won't be optimal.</li> <li>I have a reasonable heuristic function to determine what would be a good decision</li> <li>I have a reasonable function to determine the minimum possible time cost from a node to a goal.</li> </ul> <p>Algorithms:</p> <ul> <li>I need to process this problem for about 10 seconds and then give the best answer I can.</li> <li>I believe A* would find me the optimal soluton. The problem is that the decision tree will be so large that I won't be able to calculate it quick enough. </li> <li>IDA* would give me a good first few choices in 10 seconds but I need a path all the way to a goal.</li> </ul> <p>At the moment I am thinking that I will start off with the known non optimal path to a goal and then perhaps use Simulated Anealing and attempt to improve it over 10 seconds.</p> <p>What would be a good algorithm to research to try to solve this sort of problem?</p>
    singulars
    1. PO
      singulars
      1. PTAnswer
    1. This table or related slice is empty.
    1. PTQuestion
    1. This table or related slice is empty.
    1. USJared Kells
    plurals
    1. This table or related slice is empty.
    1. This table or related slice is empty.
    1. This table or related slice is empty.
    1. PO
      singulars
      1. PTAnswer
    2. PO
      singulars
      1. PTAnswer
    1. VO
      singulars
      1. POBest algorithm for optimizing the decisions in a simulation
      1. This table or related slice is empty.
      1. VTUpMod
    2. VO
      singulars
      1. POBest algorithm for optimizing the decisions in a simulation
      1. This table or related slice is empty.
      1. VTUpMod
    3. VO
      singulars
      1. POBest algorithm for optimizing the decisions in a simulation
      1. USUros K
      1. VTFavorite
    1. This table or related slice is empty.
 

Querying!

 
Guidance
A row detail

Detail views are divided into sections. All the information in the data section comes from columns in the selected row. The other sections display data from other, related rows.

Related data can be related in a to-one or a to-many fashion. Captions of data related in a to-many fashion link to a list view showing a filtered view of the table.

Try moving around until you find a non-empty to-many entry and click on the label to get to one. You can move back to the root by clicking on the database name in the header.

SQuiL has stopped working due to an internal error.

If you are curious you may find further information in the browser console, which is accessible through the devtools (F12).

Reload