Not an easy task unfortunately. You'd need to run an A-star pathfinding algorithm across a graph that represents your platforms (with special consideration to jump and dropdown connections). The builtin mp grid commands aren't really sufficient because they assume a grid-shaped graph with uniform edge length. Well you could use it, but maybe 90% of the nodes would be redundant and just slow down pathfinding. You also could write a "dumb" shortest-path seeking enemy that just approaches the player and jumps and drops when neccessary, but those cannot find alternative routes and will make futile headbutts against dead ends until player moves into a position they can reach.